./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strstr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/strstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:35:50,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:35:50,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:35:50,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:35:50,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:35:50,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:35:50,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:35:50,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:35:50,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:35:50,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:35:50,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:35:50,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:35:50,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:35:50,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:35:50,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:35:50,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:35:50,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:35:50,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:35:50,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:35:50,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:35:50,903 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:35:50,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:35:50,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:35:50,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:35:50,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:35:50,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:35:50,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:35:50,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:35:50,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:35:50,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:35:50,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:35:50,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:35:50,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:35:50,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:35:50,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:35:50,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:35:50,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:35:50,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:35:50,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:35:50,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:35:50,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:35:50,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:35:50,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:35:50,962 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:35:50,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:35:50,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:35:50,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:35:50,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:35:50,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:35:50,965 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:35:50,965 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:35:50,965 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:35:50,966 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:35:50,966 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:35:50,966 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:35:50,967 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:35:50,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:35:50,967 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:35:50,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:35:50,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:35:50,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:35:50,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:35:50,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:35:50,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:35:50,968 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:35:50,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:35:50,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:35:50,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:35:50,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:35:50,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:35:50,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:35:50,971 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:35:50,971 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f0de1cabcaa1e7c1b5012604e9626b39d1f0fa44ba0399b8bd31764898831fc [2022-07-22 01:35:51,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:35:51,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:35:51,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:35:51,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:35:51,312 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:35:51,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strstr.i [2022-07-22 01:35:51,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54b60e0b/a1dfca4738a443d8b43eb03e4b10b10d/FLAG37d6325d3 [2022-07-22 01:35:51,839 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:35:51,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2022-07-22 01:35:51,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54b60e0b/a1dfca4738a443d8b43eb03e4b10b10d/FLAG37d6325d3 [2022-07-22 01:35:52,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54b60e0b/a1dfca4738a443d8b43eb03e4b10b10d [2022-07-22 01:35:52,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:35:52,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:35:52,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:35:52,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:35:52,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:35:52,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39fb2761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52, skipping insertion in model container [2022-07-22 01:35:52,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:35:52,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:35:52,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:35:52,657 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:35:52,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:35:52,722 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:35:52,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52 WrapperNode [2022-07-22 01:35:52,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:35:52,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:35:52,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:35:52,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:35:52,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,775 INFO L137 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 177 [2022-07-22 01:35:52,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:35:52,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:35:52,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:35:52,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:35:52,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:35:52,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:35:52,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:35:52,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:35:52,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (1/1) ... [2022-07-22 01:35:52,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:52,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:52,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 01:35:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 01:35:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 01:35:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 01:35:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 01:35:52,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:35:52,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:35:53,028 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:35:53,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:35:53,280 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:35:53,287 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:35:53,287 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 01:35:53,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:35:53 BoogieIcfgContainer [2022-07-22 01:35:53,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:35:53,291 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:35:53,291 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:35:53,294 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:35:53,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:35:53,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:35:52" (1/3) ... [2022-07-22 01:35:53,296 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ac36f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:35:53, skipping insertion in model container [2022-07-22 01:35:53,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:35:53,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:35:52" (2/3) ... [2022-07-22 01:35:53,296 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ac36f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:35:53, skipping insertion in model container [2022-07-22 01:35:53,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:35:53,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:35:53" (3/3) ... [2022-07-22 01:35:53,298 INFO L354 chiAutomizerObserver]: Analyzing ICFG strstr.i [2022-07-22 01:35:53,353 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:35:53,354 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:35:53,354 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:35:53,354 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:35:53,354 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:35:53,354 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:35:53,354 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:35:53,355 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:35:53,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:53,379 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2022-07-22 01:35:53,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:35:53,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:35:53,383 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:35:53,383 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:35:53,383 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:35:53,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:53,385 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2022-07-22 01:35:53,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:35:53,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:35:53,386 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:35:53,386 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:35:53,390 INFO L752 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 11#L542true assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 3#L544-3true [2022-07-22 01:35:53,391 INFO L754 eck$LassoCheckResult]: Loop: 3#L544-3true assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 4#L544-2true main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3#L544-3true [2022-07-22 01:35:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:53,410 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-07-22 01:35:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:53,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187542638] [2022-07-22 01:35:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:53,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:53,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2022-07-22 01:35:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:53,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640486738] [2022-07-22 01:35:53,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:53,568 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:53,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2022-07-22 01:35:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:53,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450394184] [2022-07-22 01:35:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:53,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:53,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:53,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:53,848 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:35:53,848 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:35:53,849 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:35:53,849 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:35:53,849 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:35:53,849 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:53,849 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:35:53,849 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:35:53,849 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2022-07-22 01:35:53,850 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:35:53,850 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:35:53,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:53,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:54,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:54,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:54,270 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:35:54,274 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:35:54,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 01:35:54,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 01:35:54,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 01:35:54,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 01:35:54,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:54,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:54,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 01:35:54,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 01:35:54,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 01:35:54,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 01:35:54,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,477 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,478 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 01:35:54,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,496 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 01:35:54,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,525 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 01:35:54,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,556 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 01:35:54,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,582 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 01:35:54,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,639 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-22 01:35:54,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,641 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 01:35:54,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,694 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 01:35:54,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,721 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 01:35:54,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:54,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:54,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,758 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:54,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:54,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 01:35:54,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,823 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 01:35:54,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:54,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:54,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:54,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:54,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,859 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 01:35:54,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:54,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:54,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:54,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-22 01:35:54,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,923 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:54,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 01:35:54,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:54,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:54,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:54,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:54,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:54,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:54,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:54,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:35:54,991 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-22 01:35:54,991 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-22 01:35:54,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:54,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:54,999 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:55,010 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:35:55,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 01:35:55,036 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:35:55,036 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:35:55,036 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_~in_len~0#1) = -1*ULTIMATE.start_main_~i~2#1 + 1*ULTIMATE.start_main_~in_len~0#1 Supporting invariants [] [2022-07-22 01:35:55,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:55,081 INFO L293 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-07-22 01:35:55,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:55,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:35:55,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:35:55,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:35:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:35:55,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:35:55,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:35:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:35:55,202 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 01:35:55,204 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:55,262 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 39 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 112 states and 165 transitions. Complement of second has 7 states. [2022-07-22 01:35:55,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:35:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-07-22 01:35:55,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 3 letters. Loop has 2 letters. [2022-07-22 01:35:55,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:35:55,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 01:35:55,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:35:55,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 112 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-22 01:35:55,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:35:55,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 165 transitions. [2022-07-22 01:35:55,277 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2022-07-22 01:35:55,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 34 states and 44 transitions. [2022-07-22 01:35:55,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-22 01:35:55,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-22 01:35:55,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2022-07-22 01:35:55,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:35:55,281 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-22 01:35:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2022-07-22 01:35:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-22 01:35:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-07-22 01:35:55,301 INFO L392 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-22 01:35:55,301 INFO L374 stractBuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-07-22 01:35:55,301 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:35:55,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2022-07-22 01:35:55,302 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2022-07-22 01:35:55,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:35:55,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:35:55,303 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 01:35:55,303 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:35:55,303 INFO L752 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 217#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 205#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 206#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 215#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 209#L552-3 [2022-07-22 01:35:55,303 INFO L754 eck$LassoCheckResult]: Loop: 209#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 211#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 209#L552-3 [2022-07-22 01:35:55,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash 889572430, now seen corresponding path program 1 times [2022-07-22 01:35:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:55,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414702944] [2022-07-22 01:35:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:55,317 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:55,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2022-07-22 01:35:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:55,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444444081] [2022-07-22 01:35:55,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:55,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:55,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash 180614416, now seen corresponding path program 1 times [2022-07-22 01:35:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:55,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093977245] [2022-07-22 01:35:55,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:55,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:55,358 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:55,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:55,700 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:35:55,700 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:35:55,700 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:35:55,700 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:35:55,700 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:35:55,700 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:55,700 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:35:55,700 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:35:55,700 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration2_Lasso [2022-07-22 01:35:55,700 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:35:55,700 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:35:55,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:55,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:56,220 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:35:56,220 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:35:56,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,224 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:56,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:56,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:56,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 01:35:56,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:56,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,282 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 01:35:56,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:56,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:56,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:56,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,327 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 01:35:56,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:56,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:56,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:56,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:56,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,374 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:56,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:56,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:56,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 01:35:56,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 01:35:56,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,418 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 01:35:56,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:56,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:56,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:56,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,445 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-22 01:35:56,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,447 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 01:35:56,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:56,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:56,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:56,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:56,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,473 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 01:35:56,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:56,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:56,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:56,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 01:35:56,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,497 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 01:35:56,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:56,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:56,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:56,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 01:35:56,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,523 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 01:35:56,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:56,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:56,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 01:35:56,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,574 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 01:35:56,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:56,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:56,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:56,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 01:35:56,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,614 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 01:35:56,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:56,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:56,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:56,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:56,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:56,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:56,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:56,653 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:35:56,670 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 01:35:56,670 INFO L444 ModelExtractionUtils]: 12 out of 40 variables were initially zero. Simplification set additionally 25 variables to zero. [2022-07-22 01:35:56,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:56,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:56,672 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:56,679 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:35:56,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 01:35:56,704 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:35:56,704 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:35:56,704 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~out_len~0#1, ULTIMATE.start_main_~i~3#1) = 1*ULTIMATE.start_main_~out_len~0#1 - 1*ULTIMATE.start_main_~i~3#1 Supporting invariants [] [2022-07-22 01:35:56,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:56,754 INFO L293 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-07-22 01:35:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:35:56,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:35:56,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:35:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:35:56,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:35:56,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:35:56,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:35:56,820 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 01:35:56,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:56,845 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 44 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 81 transitions. Complement of second has 6 states. [2022-07-22 01:35:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:35:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-07-22 01:35:56,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 01:35:56,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:35:56,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 01:35:56,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:35:56,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-22 01:35:56,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:35:56,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 81 transitions. [2022-07-22 01:35:56,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-22 01:35:56,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 35 states and 46 transitions. [2022-07-22 01:35:56,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-22 01:35:56,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-22 01:35:56,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2022-07-22 01:35:56,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:35:56,851 INFO L369 hiAutomatonCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-22 01:35:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2022-07-22 01:35:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-22 01:35:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-07-22 01:35:56,854 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-22 01:35:56,854 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-22 01:35:56,855 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:35:56,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2022-07-22 01:35:56,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-22 01:35:56,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:35:56,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:35:56,856 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:35:56,856 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:35:56,856 INFO L752 eck$LassoCheckResult]: Stem: 413#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 396#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 397#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 382#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 383#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 393#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 386#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 387#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 390#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 398#L510-4 [2022-07-22 01:35:56,857 INFO L754 eck$LassoCheckResult]: Loop: 398#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 399#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 407#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 398#L510-4 [2022-07-22 01:35:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1304077847, now seen corresponding path program 1 times [2022-07-22 01:35:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:56,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678064074] [2022-07-22 01:35:56,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:56,876 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:56,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:56,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:56,895 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 1 times [2022-07-22 01:35:56,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:56,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65750133] [2022-07-22 01:35:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:56,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:56,900 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:56,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1803996476, now seen corresponding path program 1 times [2022-07-22 01:35:56,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:56,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766904556] [2022-07-22 01:35:56,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:56,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:35:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:35:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:35:57,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766904556] [2022-07-22 01:35:57,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766904556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:35:57,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:35:57,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 01:35:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244473987] [2022-07-22 01:35:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:35:57,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:35:57,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:35:57,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 01:35:57,049 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 16 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:35:57,219 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-07-22 01:35:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:35:57,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2022-07-22 01:35:57,223 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 27 [2022-07-22 01:35:57,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 76 transitions. [2022-07-22 01:35:57,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-22 01:35:57,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-22 01:35:57,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 76 transitions. [2022-07-22 01:35:57,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:35:57,225 INFO L369 hiAutomatonCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-07-22 01:35:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 76 transitions. [2022-07-22 01:35:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-07-22 01:35:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-07-22 01:35:57,228 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-22 01:35:57,228 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-07-22 01:35:57,228 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:35:57,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2022-07-22 01:35:57,229 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-22 01:35:57,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:35:57,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:35:57,229 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:35:57,229 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:35:57,229 INFO L752 eck$LassoCheckResult]: Stem: 525#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 506#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 507#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 493#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 494#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 505#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 497#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 498#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 531#L509 assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0; 503#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 504#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 513#L510-10 [2022-07-22 01:35:57,229 INFO L754 eck$LassoCheckResult]: Loop: 513#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 514#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 516#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 513#L510-10 [2022-07-22 01:35:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash -911639398, now seen corresponding path program 1 times [2022-07-22 01:35:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:57,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795104965] [2022-07-22 01:35:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:35:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:35:57,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:35:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795104965] [2022-07-22 01:35:57,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795104965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:35:57,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:35:57,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:35:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015311928] [2022-07-22 01:35:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:35:57,267 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:35:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:57,267 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 1 times [2022-07-22 01:35:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:57,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115749385] [2022-07-22 01:35:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:57,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:57,276 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:57,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:57,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:35:57,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:35:57,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:35:57,323 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:35:57,345 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-07-22 01:35:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:35:57,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2022-07-22 01:35:57,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-22 01:35:57,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2022-07-22 01:35:57,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-22 01:35:57,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-07-22 01:35:57,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2022-07-22 01:35:57,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:35:57,349 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-07-22 01:35:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2022-07-22 01:35:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-22 01:35:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-07-22 01:35:57,354 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-07-22 01:35:57,354 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-07-22 01:35:57,355 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:35:57,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 49 transitions. [2022-07-22 01:35:57,355 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-07-22 01:35:57,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:35:57,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:35:57,356 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:35:57,357 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:35:57,357 INFO L752 eck$LassoCheckResult]: Stem: 612#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 593#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 594#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 580#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 581#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 592#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 584#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 586#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 587#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 588#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 589#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 597#L510-4 [2022-07-22 01:35:57,357 INFO L754 eck$LassoCheckResult]: Loop: 597#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 598#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 606#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 597#L510-4 [2022-07-22 01:35:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash -909922795, now seen corresponding path program 1 times [2022-07-22 01:35:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:57,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152639981] [2022-07-22 01:35:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:57,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:57,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:57,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 2 times [2022-07-22 01:35:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:57,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280837893] [2022-07-22 01:35:57,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:57,413 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:57,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:57,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1971331970, now seen corresponding path program 1 times [2022-07-22 01:35:57,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:57,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411539729] [2022-07-22 01:35:57,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:57,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:57,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:57,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:58,084 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:35:58,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:35:58,084 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:35:58,084 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:35:58,084 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:35:58,084 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:58,084 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:35:58,084 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:35:58,084 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration5_Lasso [2022-07-22 01:35:58,084 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:35:58,084 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:35:58,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:58,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:35:59,021 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:35:59,021 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:35:59,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,028 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:59,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:59,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:59,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 01:35:59,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:59,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,066 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 01:35:59,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:59,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:59,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:59,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:59,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,092 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 01:35:59,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:59,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:59,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:59,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 01:35:59,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,116 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 01:35:59,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:35:59,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:35:59,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:35:59,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 01:35:59,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,145 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 01:35:59,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:59,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:59,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:59,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,217 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,220 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:59,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:59,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 01:35:59,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:59,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,268 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 01:35:59,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:59,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:59,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 01:35:59,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,316 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 01:35:59,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:59,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:59,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:59,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,360 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 01:35:59,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:59,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:59,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 01:35:59,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,398 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 01:35:59,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:59,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:59,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:59,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,434 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 01:35:59,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,441 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 01:35:59,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,445 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-22 01:35:59,445 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 01:35:59,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:35:59,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,496 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:35:59,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:35:59,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:35:59,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:35:59,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:35:59,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:35:59,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:35:59,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 01:35:59,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:35:59,576 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 01:35:59,576 INFO L444 ModelExtractionUtils]: 10 out of 55 variables were initially zero. Simplification set additionally 42 variables to zero. [2022-07-22 01:35:59,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:35:59,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:35:59,578 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:35:59,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 01:35:59,580 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:35:59,586 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:35:59,586 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:35:59,586 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_1, ULTIMATE.start_strlen_~s#1.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_1 - 1*ULTIMATE.start_strlen_~s#1.offset Supporting invariants [] [2022-07-22 01:35:59,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:59,630 INFO L293 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2022-07-22 01:35:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:35:59,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:35:59,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:35:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:35:59,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:35:59,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:35:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:35:59,696 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 01:35:59,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:59,705 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 57 transitions. Complement of second has 5 states. [2022-07-22 01:35:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:35:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-07-22 01:35:59,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2022-07-22 01:35:59,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:35:59,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-22 01:35:59,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:35:59,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-22 01:35:59,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:35:59,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2022-07-22 01:35:59,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-07-22 01:35:59,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 41 states and 52 transitions. [2022-07-22 01:35:59,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 01:35:59,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-22 01:35:59,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2022-07-22 01:35:59,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:35:59,709 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-07-22 01:35:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2022-07-22 01:35:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-07-22 01:35:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.275) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:35:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-07-22 01:35:59,711 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-22 01:35:59,711 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-22 01:35:59,711 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:35:59,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2022-07-22 01:35:59,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-07-22 01:35:59,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:35:59,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:35:59,712 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:35:59,712 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:35:59,712 INFO L752 eck$LassoCheckResult]: Stem: 809#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 788#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 789#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 775#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 776#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 787#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 779#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 780#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 784#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 792#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 793#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 811#L510-5 strlen_#res#1 := strlen_~i~0#1; 785#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 786#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 797#L510-10 [2022-07-22 01:35:59,712 INFO L754 eck$LassoCheckResult]: Loop: 797#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 798#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 802#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 797#L510-10 [2022-07-22 01:35:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:59,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1526227897, now seen corresponding path program 1 times [2022-07-22 01:35:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:59,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758455579] [2022-07-22 01:35:59,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:59,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:59,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 01:35:59,746 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:59,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 2 times [2022-07-22 01:35:59,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:59,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044362931] [2022-07-22 01:35:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:59,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:59,770 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:35:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:35:59,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:35:59,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:35:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1331413406, now seen corresponding path program 1 times [2022-07-22 01:35:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:35:59,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192767775] [2022-07-22 01:35:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:35:59,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:35:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:35:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:35:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:35:59,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192767775] [2022-07-22 01:35:59,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192767775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:35:59,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:35:59,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 01:35:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430678500] [2022-07-22 01:35:59,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:35:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:35:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 01:35:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 01:35:59,969 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. cyclomatic complexity: 16 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:00,139 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2022-07-22 01:36:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 01:36:00,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 104 transitions. [2022-07-22 01:36:00,146 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2022-07-22 01:36:00,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 104 transitions. [2022-07-22 01:36:00,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2022-07-22 01:36:00,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2022-07-22 01:36:00,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 104 transitions. [2022-07-22 01:36:00,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:00,148 INFO L369 hiAutomatonCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-07-22 01:36:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 104 transitions. [2022-07-22 01:36:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2022-07-22 01:36:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 59 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2022-07-22 01:36:00,152 INFO L392 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-07-22 01:36:00,152 INFO L374 stractBuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-07-22 01:36:00,152 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:36:00,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 76 transitions. [2022-07-22 01:36:00,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-07-22 01:36:00,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:00,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:00,154 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:00,154 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:00,154 INFO L752 eck$LassoCheckResult]: Stem: 958#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 937#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 938#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 923#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 925#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 926#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 927#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 980#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 928#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 929#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 933#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 941#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 942#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 964#L510-5 strlen_#res#1 := strlen_~i~0#1; 934#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 935#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 946#L510-10 [2022-07-22 01:36:00,154 INFO L754 eck$LassoCheckResult]: Loop: 946#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 947#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 960#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 946#L510-10 [2022-07-22 01:36:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -432721371, now seen corresponding path program 1 times [2022-07-22 01:36:00,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:00,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443684955] [2022-07-22 01:36:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:00,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:00,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:00,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 3 times [2022-07-22 01:36:00,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:00,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834794931] [2022-07-22 01:36:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:00,184 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:00,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:00,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:00,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2005437500, now seen corresponding path program 1 times [2022-07-22 01:36:00,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:00,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699223005] [2022-07-22 01:36:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:00,203 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:00,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:00,991 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:36:00,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:36:00,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:36:00,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:36:00,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:36:00,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:00,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:36:00,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:36:00,992 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2022-07-22 01:36:00,992 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:36:00,992 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:36:00,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:00,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:00,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,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-22 01:36:01,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-22 01:36:01,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:01,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-22 01:36:01,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-22 01:36:01,879 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:36:01,879 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:36:01,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:01,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:01,880 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:01,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 01:36:01,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:01,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:01,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:01,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:01,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:01,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:01,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:01,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:01,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:01,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-22 01:36:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:01,920 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:01,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 01:36:01,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:01,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:01,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:01,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:01,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:01,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:01,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:01,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:01,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:01,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:01,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:01,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:01,945 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:01,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 01:36:01,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:01,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:01,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:01,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:01,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:01,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:01,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:01,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:01,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:01,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:01,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:01,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:01,975 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:01,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 01:36:01,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:01,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:01,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:01,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:01,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:01,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:01,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:01,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:01,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-22 01:36:02,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,004 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 01:36:02,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 01:36:02,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,028 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 01:36:02,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:02,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:02,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 01:36:02,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,055 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 01:36:02,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:02,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,106 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 01:36:02,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:02,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,157 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:02,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:02,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 01:36:02,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:02,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,206 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 01:36:02,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:02,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,258 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:02,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:02,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 01:36:02,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:02,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,315 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 01:36:02,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:02,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,361 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 01:36:02,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-22 01:36:02,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,406 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 01:36:02,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-22 01:36:02,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,430 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 01:36:02,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-22 01:36:02,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,454 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 01:36:02,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 01:36:02,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,483 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 01:36:02,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-22 01:36:02,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,507 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-22 01:36:02,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-22 01:36:02,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:02,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:02,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:02,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,533 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 01:36:02,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-22 01:36:02,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,557 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-22 01:36:02,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:02,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:02,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-22 01:36:02,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,585 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-22 01:36:02,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-22 01:36:02,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,609 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-22 01:36:02,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-22 01:36:02,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,634 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-22 01:36:02,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-22 01:36:02,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,661 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-22 01:36:02,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:02,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,715 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-22 01:36:02,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-22 01:36:02,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,743 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-22 01:36:02,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:02,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,767 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-22 01:36:02,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-22 01:36:02,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,792 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-22 01:36:02,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-22 01:36:02,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:02,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:02,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:02,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-22 01:36:02,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,816 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-22 01:36:02,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,823 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 01:36:02,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,827 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-22 01:36:02,828 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 01:36:02,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-22 01:36:02,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,851 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-22 01:36:02,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:02,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:02,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-22 01:36:02,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,878 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-22 01:36:02,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:02,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:02,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:02,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-22 01:36:02,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:02,910 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:02,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-22 01:36:02,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:02,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:02,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:02,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:02,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:02,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:02,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:02,963 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:36:03,035 INFO L443 ModelExtractionUtils]: Simplification made 31 calls to the SMT solver. [2022-07-22 01:36:03,035 INFO L444 ModelExtractionUtils]: 22 out of 55 variables were initially zero. Simplification set additionally 30 variables to zero. [2022-07-22 01:36:03,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:03,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:03,038 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:03,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-22 01:36:03,039 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:36:03,047 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:36:03,047 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:36:03,047 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s#1.offset, v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_3) = -1*ULTIMATE.start_strlen_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_3 Supporting invariants [] [2022-07-22 01:36:03,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:03,113 INFO L293 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2022-07-22 01:36:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:03,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 01:36:03,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:03,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:03,265 WARN L261 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 01:36:03,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:36:03,292 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2022-07-22 01:36:03,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 76 transitions. cyclomatic complexity: 23 Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:03,363 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 76 transitions. cyclomatic complexity: 23. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 89 states and 114 transitions. Complement of second has 7 states. [2022-07-22 01:36:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 01:36:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-07-22 01:36:03,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 16 letters. Loop has 3 letters. [2022-07-22 01:36:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:36:03,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 19 letters. Loop has 3 letters. [2022-07-22 01:36:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:36:03,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 16 letters. Loop has 6 letters. [2022-07-22 01:36:03,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:36:03,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 114 transitions. [2022-07-22 01:36:03,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-07-22 01:36:03,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 74 states and 94 transitions. [2022-07-22 01:36:03,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2022-07-22 01:36:03,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2022-07-22 01:36:03,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 94 transitions. [2022-07-22 01:36:03,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:03,367 INFO L369 hiAutomatonCegarLoop]: Abstraction has 74 states and 94 transitions. [2022-07-22 01:36:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 94 transitions. [2022-07-22 01:36:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2022-07-22 01:36:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-07-22 01:36:03,370 INFO L392 hiAutomatonCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-22 01:36:03,370 INFO L374 stractBuchiCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-22 01:36:03,370 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:36:03,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 78 transitions. [2022-07-22 01:36:03,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-22 01:36:03,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:03,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:03,371 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:03,371 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:36:03,371 INFO L752 eck$LassoCheckResult]: Stem: 1264#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1243#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1244#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1227#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1228#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1240#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1232#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1233#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1237#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1245#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1246#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1266#L510-5 strlen_#res#1 := strlen_~i~0#1; 1238#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1239#L509-2 assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0; 1259#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1249#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1241#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1242#L532-3 [2022-07-22 01:36:03,371 INFO L754 eck$LassoCheckResult]: Loop: 1242#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 1265#L533 assume !strstr_#t~short17#1; 1262#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 1263#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 1242#L532-3 [2022-07-22 01:36:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:03,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1331460076, now seen corresponding path program 1 times [2022-07-22 01:36:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699768640] [2022-07-22 01:36:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:36:03,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:03,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699768640] [2022-07-22 01:36:03,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699768640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:36:03,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:36:03,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:36:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119854346] [2022-07-22 01:36:03,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:36:03,399 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 1 times [2022-07-22 01:36:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:03,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727723494] [2022-07-22 01:36:03,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:03,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:03,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:03,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:03,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:36:03,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:36:03,522 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. cyclomatic complexity: 24 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:03,549 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-07-22 01:36:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:36:03,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2022-07-22 01:36:03,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-22 01:36:03,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 76 transitions. [2022-07-22 01:36:03,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-07-22 01:36:03,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-07-22 01:36:03,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2022-07-22 01:36:03,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:03,552 INFO L369 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-07-22 01:36:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2022-07-22 01:36:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-22 01:36:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 60 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2022-07-22 01:36:03,554 INFO L392 hiAutomatonCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-07-22 01:36:03,554 INFO L374 stractBuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-07-22 01:36:03,554 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 01:36:03,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 76 transitions. [2022-07-22 01:36:03,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-22 01:36:03,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:03,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:03,555 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:03,555 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:36:03,555 INFO L752 eck$LassoCheckResult]: Stem: 1400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1376#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1377#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1361#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1362#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1420#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1418#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1419#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1421#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1380#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1381#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1403#L510-5 strlen_#res#1 := strlen_~i~0#1; 1373#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1374#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1385#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1386#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1389#L510-11 strlen_#res#1 := strlen_~i~0#1; 1395#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1384#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1378#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1379#L532-3 [2022-07-22 01:36:03,555 INFO L754 eck$LassoCheckResult]: Loop: 1379#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 1401#L533 assume !strstr_#t~short17#1; 1398#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 1399#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 1379#L532-3 [2022-07-22 01:36:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -115443887, now seen corresponding path program 1 times [2022-07-22 01:36:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:03,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392418077] [2022-07-22 01:36:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:36:03,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:03,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392418077] [2022-07-22 01:36:03,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392418077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:36:03,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:36:03,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:36:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016908751] [2022-07-22 01:36:03,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:36:03,600 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 2 times [2022-07-22 01:36:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:03,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156922332] [2022-07-22 01:36:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:03,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:03,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:03,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:03,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:03,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:36:03,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:36:03,719 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:03,774 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2022-07-22 01:36:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 01:36:03,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 118 transitions. [2022-07-22 01:36:03,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-07-22 01:36:03,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 72 states and 86 transitions. [2022-07-22 01:36:03,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-22 01:36:03,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-22 01:36:03,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 86 transitions. [2022-07-22 01:36:03,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:03,777 INFO L369 hiAutomatonCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-07-22 01:36:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 86 transitions. [2022-07-22 01:36:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2022-07-22 01:36:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-07-22 01:36:03,779 INFO L392 hiAutomatonCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-07-22 01:36:03,780 INFO L374 stractBuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-07-22 01:36:03,780 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 01:36:03,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2022-07-22 01:36:03,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-22 01:36:03,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:03,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:03,781 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:03,781 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:36:03,781 INFO L752 eck$LassoCheckResult]: Stem: 1577#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1550#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1551#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1536#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1537#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1584#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1541#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 1542#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1589#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1588#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1571#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1554#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1555#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 1581#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 1556#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1557#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1583#L510-5 strlen_#res#1 := strlen_~i~0#1; 1547#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1548#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1559#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1560#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1563#L510-11 strlen_#res#1 := strlen_~i~0#1; 1572#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1558#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1552#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1553#L532-3 [2022-07-22 01:36:03,781 INFO L754 eck$LassoCheckResult]: Loop: 1553#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 1578#L533 assume !strstr_#t~short17#1; 1575#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 1576#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 1553#L532-3 [2022-07-22 01:36:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash 278203018, now seen corresponding path program 1 times [2022-07-22 01:36:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:03,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693965966] [2022-07-22 01:36:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 01:36:03,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:03,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693965966] [2022-07-22 01:36:03,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693965966] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:03,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900077469] [2022-07-22 01:36:03,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:03,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:03,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:03,968 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:03,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-07-22 01:36:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:04,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:36:04,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 01:36:04,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:36:04,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900077469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:36:04,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:36:04,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-22 01:36:04,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528357565] [2022-07-22 01:36:04,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:36:04,075 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 3 times [2022-07-22 01:36:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:04,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502574557] [2022-07-22 01:36:04,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:04,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:04,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:04,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:36:04,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-22 01:36:04,180 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. cyclomatic complexity: 18 Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:04,228 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-07-22 01:36:04,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:36:04,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 73 transitions. [2022-07-22 01:36:04,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-22 01:36:04,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 41 states and 48 transitions. [2022-07-22 01:36:04,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-22 01:36:04,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 01:36:04,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2022-07-22 01:36:04,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:04,230 INFO L369 hiAutomatonCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-07-22 01:36:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2022-07-22 01:36:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-07-22 01:36:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-07-22 01:36:04,232 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-07-22 01:36:04,232 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-07-22 01:36:04,232 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 01:36:04,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2022-07-22 01:36:04,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-07-22 01:36:04,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:04,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:04,233 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:04,233 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:36:04,233 INFO L752 eck$LassoCheckResult]: Stem: 1783#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1762#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1763#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 1748#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 1749#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1750#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1751#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 1759#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 1752#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 1753#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1754#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1755#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1756#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1764#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1765#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 1777#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 1766#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1767#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1785#L510-5 strlen_#res#1 := strlen_~i~0#1; 1757#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 1758#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1769#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1770#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 1774#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 1771#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1772#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1773#L510-11 strlen_#res#1 := strlen_~i~0#1; 1778#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 1768#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1760#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 1761#L532-3 [2022-07-22 01:36:04,233 INFO L754 eck$LassoCheckResult]: Loop: 1761#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 1784#L533 assume !strstr_#t~short17#1; 1781#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 1782#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 1761#L532-3 [2022-07-22 01:36:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1690519729, now seen corresponding path program 1 times [2022-07-22 01:36:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:04,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941061277] [2022-07-22 01:36:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:04,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:04,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 4 times [2022-07-22 01:36:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:04,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553858696] [2022-07-22 01:36:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:04,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:04,265 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:04,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1271781261, now seen corresponding path program 1 times [2022-07-22 01:36:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:04,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049922698] [2022-07-22 01:36:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:04,291 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:04,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:05,882 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:36:05,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:36:05,882 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:36:05,882 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:36:05,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:36:05,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:05,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:36:05,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:36:05,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration11_Lasso [2022-07-22 01:36:05,882 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:36:05,882 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:36:05,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:05,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:06,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:06,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:06,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:06,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:06,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:07,380 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:36:07,380 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:36:07,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,384 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-22 01:36:07,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,413 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-22 01:36:07,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-22 01:36:07,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,437 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-22 01:36:07,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,499 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-22 01:36:07,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,550 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-22 01:36:07,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,597 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-22 01:36:07,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,643 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-22 01:36:07,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,691 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-22 01:36:07,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,742 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,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-22 01:36:07,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-22 01:36:07,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,792 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-22 01:36:07,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,841 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-22 01:36:07,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-22 01:36:07,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,882 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-22 01:36:07,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:07,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,907 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-22 01:36:07,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-22 01:36:07,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,931 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-22 01:36:07,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-22 01:36:07,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,955 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-22 01:36:07,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:07,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:07,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:07,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:07,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:07,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:07,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:07,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:07,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:07,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-22 01:36:07,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:07,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:07,997 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:07,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-22 01:36:07,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:08,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:08,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:08,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:08,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:08,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:08,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:08,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:08,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:08,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-22 01:36:08,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:08,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:08,022 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:08,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-22 01:36:08,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:08,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:08,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:08,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:08,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:08,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:08,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:08,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:08,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-07-22 01:36:08,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:08,081 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:08,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-22 01:36:08,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:08,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:08,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:08,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:08,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:08,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:08,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:08,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:08,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-07-22 01:36:08,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:08,107 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:08,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-22 01:36:08,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:08,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:08,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:08,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:08,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:08,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:08,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:08,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:08,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:08,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-22 01:36:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:08,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:08,131 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:08,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-22 01:36:08,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:08,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:08,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:08,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:08,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:08,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:08,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:08,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:08,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:08,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-22 01:36:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:08,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:08,156 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:08,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-22 01:36:08,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:08,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:08,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:08,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:08,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:08,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:08,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:08,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:08,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:08,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-22 01:36:08,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:08,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:08,180 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:08,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-22 01:36:08,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:08,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:08,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:08,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:08,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:08,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:08,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:08,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:08,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:08,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:08,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:08,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:08,204 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:08,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-22 01:36:08,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:08,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:08,211 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 01:36:08,211 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 01:36:08,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:08,226 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2022-07-22 01:36:08,227 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 01:36:08,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:08,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-07-22 01:36:08,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:08,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:08,263 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:08,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-22 01:36:08,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:08,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:08,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:08,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:08,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:08,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:08,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:08,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:36:08,382 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2022-07-22 01:36:08,382 INFO L444 ModelExtractionUtils]: 19 out of 55 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-07-22 01:36:08,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:08,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:08,387 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:08,392 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:36:08,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-22 01:36:08,411 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:36:08,411 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:36:08,411 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack#1.offset, v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_3) = -1*ULTIMATE.start_strstr_~haystack#1.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_3 Supporting invariants [] [2022-07-22 01:36:08,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:08,540 INFO L293 tatePredicateManager]: 35 out of 36 supporting invariants were superfluous and have been removed [2022-07-22 01:36:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:08,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:36:08,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:08,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:36:08,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:08,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:36:08,704 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-22 01:36:08,704 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:08,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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) Result 49 states and 61 transitions. Complement of second has 7 states. [2022-07-22 01:36:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:36:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-07-22 01:36:08,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 4 letters. [2022-07-22 01:36:08,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:36:08,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 34 letters. Loop has 4 letters. [2022-07-22 01:36:08,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:36:08,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 30 letters. Loop has 8 letters. [2022-07-22 01:36:08,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:36:08,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2022-07-22 01:36:08,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:08,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 46 states and 55 transitions. [2022-07-22 01:36:08,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-07-22 01:36:08,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-22 01:36:08,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 55 transitions. [2022-07-22 01:36:08,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:08,742 INFO L369 hiAutomatonCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-07-22 01:36:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 55 transitions. [2022-07-22 01:36:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-07-22 01:36:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.2) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-07-22 01:36:08,744 INFO L392 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-07-22 01:36:08,744 INFO L374 stractBuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-07-22 01:36:08,744 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 01:36:08,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2022-07-22 01:36:08,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:08,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:08,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:08,745 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:08,745 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:08,745 INFO L752 eck$LassoCheckResult]: Stem: 2150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2126#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 2113#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 2114#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2115#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2116#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 2124#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 2117#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 2118#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2119#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2120#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2121#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2129#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2130#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2142#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2131#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2132#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2155#L510-5 strlen_#res#1 := strlen_~i~0#1; 2122#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2123#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2134#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2135#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2139#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2136#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2137#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2138#L510-11 strlen_#res#1 := strlen_~i~0#1; 2143#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 2133#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2127#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 2128#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 2153#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 2145#L518-3 [2022-07-22 01:36:08,745 INFO L754 eck$LassoCheckResult]: Loop: 2145#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2156#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 2144#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 2145#L518-3 [2022-07-22 01:36:08,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1091824948, now seen corresponding path program 1 times [2022-07-22 01:36:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:08,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542605854] [2022-07-22 01:36:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:08,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:08,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 1 times [2022-07-22 01:36:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:08,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115696226] [2022-07-22 01:36:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:08,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:08,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:08,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 769802655, now seen corresponding path program 1 times [2022-07-22 01:36:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:08,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491029739] [2022-07-22 01:36:08,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:08,828 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:08,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:11,689 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:36:11,689 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:36:11,690 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:36:11,690 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:36:11,690 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:36:11,690 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:11,690 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:36:11,690 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:36:11,690 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration12_Lasso [2022-07-22 01:36:11,690 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:36:11,690 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:36:11,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-22 01:36:11,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:11,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:13,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:13,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:13,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:14,287 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:36:14,288 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:36:14,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,289 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-22 01:36:14,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-07-22 01:36:14,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,313 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-22 01:36:14,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-07-22 01:36:14,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,337 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-22 01:36:14,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-07-22 01:36:14,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,362 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-22 01:36:14,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-07-22 01:36:14,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,386 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-22 01:36:14,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-07-22 01:36:14,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,411 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-22 01:36:14,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:14,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:14,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-07-22 01:36:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,450 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-22 01:36:14,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-22 01:36:14,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,482 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-22 01:36:14,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-22 01:36:14,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,506 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-22 01:36:14,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-22 01:36:14,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,530 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-22 01:36:14,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-22 01:36:14,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,555 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-22 01:36:14,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-07-22 01:36:14,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,579 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-22 01:36:14,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-07-22 01:36:14,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,652 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-22 01:36:14,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-22 01:36:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,679 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-22 01:36:14,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:14,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,703 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-07-22 01:36:14,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:14,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:14,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:14,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,730 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-07-22 01:36:14,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:14,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:14,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:14,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,757 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-07-22 01:36:14,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-22 01:36:14,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,781 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-07-22 01:36:14,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-07-22 01:36:14,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,806 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-07-22 01:36:14,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-07-22 01:36:14,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,831 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-07-22 01:36:14,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-07-22 01:36:14,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,858 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-07-22 01:36:14,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2022-07-22 01:36:14,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,883 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-07-22 01:36:14,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-07-22 01:36:14,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,908 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-07-22 01:36:14,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:14,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:14,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:14,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,936 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-07-22 01:36:14,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2022-07-22 01:36:14,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,961 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-07-22 01:36:14,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:14,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:14,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:14,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:14,987 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:14,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-07-22 01:36:14,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:14,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:14,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:14,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:14,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:14,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:14,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:14,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:14,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:15,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,017 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-07-22 01:36:15,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:15,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:15,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:15,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2022-07-22 01:36:15,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,044 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-07-22 01:36:15,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:15,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:15,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:15,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:15,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,070 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-22 01:36:15,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:15,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:15,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:15,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-07-22 01:36:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,096 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-22 01:36:15,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:15,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:15,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:15,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2022-07-22 01:36:15,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,121 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-22 01:36:15,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:36:15,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:36:15,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:36:15,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:15,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,153 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-22 01:36:15,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-22 01:36:15,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:15,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:15,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-07-22 01:36:15,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,180 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-22 01:36:15,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:15,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:15,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-07-22 01:36:15,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,208 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-22 01:36:15,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:15,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:15,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-07-22 01:36:15,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,252 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-22 01:36:15,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:15,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:15,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:15,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,281 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-22 01:36:15,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-22 01:36:15,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:15,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:15,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-07-22 01:36:15,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,326 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-22 01:36:15,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:15,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:15,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:36:15,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:15,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,375 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:36:15,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:36:15,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:36:15,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:36:15,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:36:15,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:36:15,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:36:15,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-22 01:36:15,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:36:15,487 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-07-22 01:36:15,487 INFO L444 ModelExtractionUtils]: 13 out of 85 variables were initially zero. Simplification set additionally 69 variables to zero. [2022-07-22 01:36:15,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:15,489 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:36:15,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-22 01:36:15,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:36:15,496 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:36:15,496 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:36:15,496 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~s~0#1.offset, v_rep(select #length ULTIMATE.start_strstr_~needle#1.base)_2) = -1*ULTIMATE.start_memcmp_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_strstr_~needle#1.base)_2 Supporting invariants [] [2022-07-22 01:36:15,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:15,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:15,732 INFO L293 tatePredicateManager]: 59 out of 60 supporting invariants were superfluous and have been removed [2022-07-22 01:36:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:15,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:36:15,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:15,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:36:15,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:36:15,837 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 01:36:15,837 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:15,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 15. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 92 states and 112 transitions. Complement of second has 7 states. [2022-07-22 01:36:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:36:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-07-22 01:36:15,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 32 letters. Loop has 3 letters. [2022-07-22 01:36:15,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:36:15,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 35 letters. Loop has 3 letters. [2022-07-22 01:36:15,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:36:15,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 32 letters. Loop has 6 letters. [2022-07-22 01:36:15,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:36:15,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 112 transitions. [2022-07-22 01:36:15,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:15,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 69 states and 84 transitions. [2022-07-22 01:36:15,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-22 01:36:15,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-07-22 01:36:15,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 84 transitions. [2022-07-22 01:36:15,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:15,885 INFO L369 hiAutomatonCegarLoop]: Abstraction has 69 states and 84 transitions. [2022-07-22 01:36:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 84 transitions. [2022-07-22 01:36:15,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2022-07-22 01:36:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-07-22 01:36:15,892 INFO L392 hiAutomatonCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-07-22 01:36:15,892 INFO L374 stractBuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-07-22 01:36:15,893 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 01:36:15,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 65 transitions. [2022-07-22 01:36:15,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:15,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:15,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:15,897 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:15,898 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:15,899 INFO L752 eck$LassoCheckResult]: Stem: 2660#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2636#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2637#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 2624#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 2625#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2626#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2627#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 2635#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 2628#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 2629#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2630#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2631#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2632#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2640#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2641#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2653#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2642#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2643#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2667#L510-5 strlen_#res#1 := strlen_~i~0#1; 2633#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2634#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2645#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2646#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2652#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2647#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2648#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2651#L510-11 strlen_#res#1 := strlen_~i~0#1; 2654#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 2644#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2638#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 2639#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 2664#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 2666#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2675#L518-1 assume !(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1; 2649#L518-4 memcmp_#res#1 := 0; 2650#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 2658#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 2659#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 2662#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 2663#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 2656#L518-3 [2022-07-22 01:36:15,900 INFO L754 eck$LassoCheckResult]: Loop: 2656#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2668#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 2655#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 2656#L518-3 [2022-07-22 01:36:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash -840479618, now seen corresponding path program 1 times [2022-07-22 01:36:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:15,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749656658] [2022-07-22 01:36:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:15,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 01:36:15,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:15,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749656658] [2022-07-22 01:36:15,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749656658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:36:15,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:36:15,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:36:15,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410594427] [2022-07-22 01:36:15,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:36:15,946 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:15,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 2 times [2022-07-22 01:36:15,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:15,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420349312] [2022-07-22 01:36:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:15,956 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:15,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:16,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:16,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:36:16,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:36:16,062 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:16,082 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-07-22 01:36:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:36:16,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 66 transitions. [2022-07-22 01:36:16,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:16,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 53 states and 62 transitions. [2022-07-22 01:36:16,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-07-22 01:36:16,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-07-22 01:36:16,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 62 transitions. [2022-07-22 01:36:16,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:16,084 INFO L369 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-22 01:36:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 62 transitions. [2022-07-22 01:36:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-22 01:36:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.169811320754717) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-07-22 01:36:16,085 INFO L392 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-22 01:36:16,085 INFO L374 stractBuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-07-22 01:36:16,085 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 01:36:16,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2022-07-22 01:36:16,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:16,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:16,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:16,086 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:16,086 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:16,087 INFO L752 eck$LassoCheckResult]: Stem: 2778#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2757#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2758#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 2743#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 2744#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2745#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2746#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 2754#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 2747#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 2748#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2749#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2750#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2751#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2759#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2760#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2770#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2761#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2762#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2784#L510-5 strlen_#res#1 := strlen_~i~0#1; 2752#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 2753#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2764#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2765#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 2769#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 2766#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2767#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2768#L510-11 strlen_#res#1 := strlen_~i~0#1; 2771#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 2763#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2755#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 2756#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 2781#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 2775#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2788#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 2789#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 2782#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 2783#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 2791#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 2790#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 2780#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 2773#L518-3 [2022-07-22 01:36:16,087 INFO L754 eck$LassoCheckResult]: Loop: 2773#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2785#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 2772#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 2773#L518-3 [2022-07-22 01:36:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash 762752838, now seen corresponding path program 1 times [2022-07-22 01:36:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:16,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688219073] [2022-07-22 01:36:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:16,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 01:36:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:16,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688219073] [2022-07-22 01:36:16,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688219073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:16,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390605548] [2022-07-22 01:36:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:16,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:16,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:16,248 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:16,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-07-22 01:36:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:16,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-22 01:36:16,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:16,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 01:36:16,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:36:16,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 01:36:16,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2022-07-22 01:36:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 01:36:16,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:36:17,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2022-07-22 01:36:17,247 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 01:36:17,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2022-07-22 01:36:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 01:36:17,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390605548] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:36:17,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:36:17,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 33 [2022-07-22 01:36:17,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55580512] [2022-07-22 01:36:17,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:36:17,250 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:17,250 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 3 times [2022-07-22 01:36:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:17,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047766352] [2022-07-22 01:36:17,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:17,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:17,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:17,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:17,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-22 01:36:17,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 01:36:17,353 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 17 Second operand has 33 states, 33 states have (on average 3.212121212121212) internal successors, (106), 33 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:19,360 INFO L93 Difference]: Finished difference Result 260 states and 304 transitions. [2022-07-22 01:36:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-22 01:36:19,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 304 transitions. [2022-07-22 01:36:19,363 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-07-22 01:36:19,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 238 states and 281 transitions. [2022-07-22 01:36:19,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-07-22 01:36:19,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-07-22 01:36:19,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 281 transitions. [2022-07-22 01:36:19,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:19,365 INFO L369 hiAutomatonCegarLoop]: Abstraction has 238 states and 281 transitions. [2022-07-22 01:36:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 281 transitions. [2022-07-22 01:36:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 88. [2022-07-22 01:36:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-07-22 01:36:19,367 INFO L392 hiAutomatonCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-07-22 01:36:19,368 INFO L374 stractBuchiCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-07-22 01:36:19,368 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 01:36:19,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 101 transitions. [2022-07-22 01:36:19,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:19,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:19,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:19,369 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:19,369 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:19,369 INFO L752 eck$LassoCheckResult]: Stem: 3459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3434#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 3435#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 3420#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 3421#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3422#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 3423#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 3431#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 3424#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 3425#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3426#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 3427#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3428#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3436#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3437#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 3450#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 3438#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3440#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3466#L510-5 strlen_#res#1 := strlen_~i~0#1; 3429#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 3430#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3451#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3448#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 3449#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 3444#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3445#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 3474#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 3473#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3446#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3447#L510-11 strlen_#res#1 := strlen_~i~0#1; 3452#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 3441#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 3432#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 3433#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 3470#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3456#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3485#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 3484#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 3465#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 3464#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 3482#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 3481#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 3462#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 3454#L518-3 [2022-07-22 01:36:19,370 INFO L754 eck$LassoCheckResult]: Loop: 3454#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3467#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 3453#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 3454#L518-3 [2022-07-22 01:36:19,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:19,370 INFO L85 PathProgramCache]: Analyzing trace with hash 717589665, now seen corresponding path program 2 times [2022-07-22 01:36:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:19,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64635442] [2022-07-22 01:36:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:19,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 01:36:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:19,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64635442] [2022-07-22 01:36:19,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64635442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:19,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855975719] [2022-07-22 01:36:19,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:36:19,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:19,532 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:19,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2022-07-22 01:36:19,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:36:19,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:36:19,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-22 01:36:19,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:19,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 01:36:19,692 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 01:36:19,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-22 01:36:20,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-22 01:36:20,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:36:20,380 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 01:36:20,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 24 [2022-07-22 01:36:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 01:36:20,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:36:20,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 01:36:20,858 INFO L356 Elim1Store]: treesize reduction 17, result has 74.2 percent of original size [2022-07-22 01:36:20,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 60 [2022-07-22 01:36:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 01:36:21,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855975719] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:36:21,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:36:21,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 45 [2022-07-22 01:36:21,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80934984] [2022-07-22 01:36:21,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:36:21,484 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 4 times [2022-07-22 01:36:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:21,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47870660] [2022-07-22 01:36:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:21,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:21,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:21,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:21,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-22 01:36:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2022-07-22 01:36:21,601 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. cyclomatic complexity: 22 Second operand has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:22,735 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2022-07-22 01:36:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-22 01:36:22,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 198 transitions. [2022-07-22 01:36:22,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 01:36:22,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 161 states and 184 transitions. [2022-07-22 01:36:22,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2022-07-22 01:36:22,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-07-22 01:36:22,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 184 transitions. [2022-07-22 01:36:22,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:22,738 INFO L369 hiAutomatonCegarLoop]: Abstraction has 161 states and 184 transitions. [2022-07-22 01:36:22,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 184 transitions. [2022-07-22 01:36:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 112. [2022-07-22 01:36:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 111 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2022-07-22 01:36:22,741 INFO L392 hiAutomatonCegarLoop]: Abstraction has 112 states and 128 transitions. [2022-07-22 01:36:22,741 INFO L374 stractBuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2022-07-22 01:36:22,741 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-22 01:36:22,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 128 transitions. [2022-07-22 01:36:22,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:22,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:22,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:22,742 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:22,742 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:22,742 INFO L752 eck$LassoCheckResult]: Stem: 4066#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4040#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4041#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 4025#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 4026#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4109#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 4029#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4027#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4028#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 4037#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 4030#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 4031#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4032#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4033#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4036#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4042#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4043#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4078#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4044#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4045#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4085#L510-5 strlen_#res#1 := strlen_~i~0#1; 4086#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4057#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4058#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4116#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4115#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4050#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4051#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4074#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4075#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4129#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4128#L510-11 strlen_#res#1 := strlen_~i~0#1; 4127#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 4126#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4125#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 4082#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4083#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4063#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4087#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4088#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4117#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 4113#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 4111#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 4110#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4068#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4061#L518-3 [2022-07-22 01:36:22,742 INFO L754 eck$LassoCheckResult]: Loop: 4061#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4079#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4060#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4061#L518-3 [2022-07-22 01:36:22,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:22,742 INFO L85 PathProgramCache]: Analyzing trace with hash -900142205, now seen corresponding path program 3 times [2022-07-22 01:36:22,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:22,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838744434] [2022-07-22 01:36:22,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:22,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 01:36:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:22,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838744434] [2022-07-22 01:36:22,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838744434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:36:22,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:36:22,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:36:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675551600] [2022-07-22 01:36:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:36:22,853 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 5 times [2022-07-22 01:36:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:22,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004220125] [2022-07-22 01:36:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:22,859 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:22,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:22,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:22,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:36:22,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:36:22,961 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. cyclomatic complexity: 27 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:22,999 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2022-07-22 01:36:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:36:23,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 145 transitions. [2022-07-22 01:36:23,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:23,001 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 125 states and 141 transitions. [2022-07-22 01:36:23,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-07-22 01:36:23,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-07-22 01:36:23,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 141 transitions. [2022-07-22 01:36:23,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:23,002 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 141 transitions. [2022-07-22 01:36:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 141 transitions. [2022-07-22 01:36:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2022-07-22 01:36:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 116 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2022-07-22 01:36:23,004 INFO L392 hiAutomatonCegarLoop]: Abstraction has 117 states and 133 transitions. [2022-07-22 01:36:23,004 INFO L374 stractBuchiCegarLoop]: Abstraction has 117 states and 133 transitions. [2022-07-22 01:36:23,005 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-22 01:36:23,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 133 transitions. [2022-07-22 01:36:23,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:23,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:23,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:23,006 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:23,006 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:23,006 INFO L752 eck$LassoCheckResult]: Stem: 4321#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4293#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 4278#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 4279#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4361#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 4282#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4280#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4281#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 4339#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 4340#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 4360#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4359#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4358#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4313#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4296#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4297#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4310#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4298#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4299#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4330#L510-5 strlen_#res#1 := strlen_~i~0#1; 4366#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4311#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4312#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4308#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4309#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4304#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4305#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4394#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4393#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4392#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4391#L510-11 strlen_#res#1 := strlen_~i~0#1; 4390#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 4389#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4388#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 4335#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4336#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4384#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4338#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4317#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4318#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4375#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4362#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4363#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 4349#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 4346#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 4344#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4324#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4316#L518-3 [2022-07-22 01:36:23,007 INFO L754 eck$LassoCheckResult]: Loop: 4316#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4332#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4315#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4316#L518-3 [2022-07-22 01:36:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:23,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1802803372, now seen corresponding path program 1 times [2022-07-22 01:36:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:23,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440880557] [2022-07-22 01:36:23,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:23,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 01:36:23,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:23,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440880557] [2022-07-22 01:36:23,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440880557] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:23,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578289543] [2022-07-22 01:36:23,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:23,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:23,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:23,119 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:23,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2022-07-22 01:36:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:23,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 01:36:23,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 01:36:23,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:36:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 01:36:23,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578289543] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:36:23,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:36:23,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-07-22 01:36:23,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990922421] [2022-07-22 01:36:23,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:36:23,465 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:23,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 6 times [2022-07-22 01:36:23,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:23,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495770033] [2022-07-22 01:36:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:23,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:23,469 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:23,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:23,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:23,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 01:36:23,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-07-22 01:36:23,578 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. cyclomatic complexity: 27 Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:23,747 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2022-07-22 01:36:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 01:36:23,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 188 transitions. [2022-07-22 01:36:23,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 01:36:23,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 138 states and 158 transitions. [2022-07-22 01:36:23,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-07-22 01:36:23,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2022-07-22 01:36:23,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 158 transitions. [2022-07-22 01:36:23,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:23,749 INFO L369 hiAutomatonCegarLoop]: Abstraction has 138 states and 158 transitions. [2022-07-22 01:36:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 158 transitions. [2022-07-22 01:36:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2022-07-22 01:36:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 108 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2022-07-22 01:36:23,751 INFO L392 hiAutomatonCegarLoop]: Abstraction has 109 states and 124 transitions. [2022-07-22 01:36:23,752 INFO L374 stractBuchiCegarLoop]: Abstraction has 109 states and 124 transitions. [2022-07-22 01:36:23,752 INFO L287 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-22 01:36:23,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 124 transitions. [2022-07-22 01:36:23,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:23,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:23,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:23,753 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:23,753 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:23,753 INFO L752 eck$LassoCheckResult]: Stem: 4918#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4890#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4891#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 4875#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 4876#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4877#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4878#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 4954#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 4881#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 4882#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4883#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4884#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4885#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4894#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4895#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4908#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4896#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4897#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4956#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4955#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4928#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4929#L510-5 strlen_#res#1 := strlen_~i~0#1; 4886#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 4887#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4939#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4938#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 4924#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 4925#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4905#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4906#L510-11 strlen_#res#1 := strlen_~i~0#1; 4935#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 4936#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4892#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 4893#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4969#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4968#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4966#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4967#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4965#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4964#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4963#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 4922#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 4923#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 4973#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 4974#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4961#L533 assume !strstr_#t~short17#1; 4960#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 4958#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 4957#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 4920#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 4913#L518-3 [2022-07-22 01:36:23,753 INFO L754 eck$LassoCheckResult]: Loop: 4913#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4930#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 4912#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 4913#L518-3 [2022-07-22 01:36:23,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1191678414, now seen corresponding path program 1 times [2022-07-22 01:36:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:23,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319465151] [2022-07-22 01:36:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:23,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 01:36:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:23,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319465151] [2022-07-22 01:36:23,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319465151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:23,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761114976] [2022-07-22 01:36:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:23,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:23,843 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:23,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2022-07-22 01:36:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:23,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 01:36:23,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:23,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 01:36:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 01:36:24,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:36:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 01:36:24,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761114976] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:36:24,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:36:24,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-07-22 01:36:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293352432] [2022-07-22 01:36:24,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:36:24,116 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:24,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 7 times [2022-07-22 01:36:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:24,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329920787] [2022-07-22 01:36:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:24,121 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:24,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:24,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:24,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 01:36:24,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-07-22 01:36:24,225 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. cyclomatic complexity: 26 Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:24,345 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2022-07-22 01:36:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 01:36:24,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 148 transitions. [2022-07-22 01:36:24,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:24,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 115 states and 130 transitions. [2022-07-22 01:36:24,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-07-22 01:36:24,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-07-22 01:36:24,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 130 transitions. [2022-07-22 01:36:24,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:24,348 INFO L369 hiAutomatonCegarLoop]: Abstraction has 115 states and 130 transitions. [2022-07-22 01:36:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 130 transitions. [2022-07-22 01:36:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-07-22 01:36:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.1327433628318584) internal successors, (128), 112 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2022-07-22 01:36:24,350 INFO L392 hiAutomatonCegarLoop]: Abstraction has 113 states and 128 transitions. [2022-07-22 01:36:24,350 INFO L374 stractBuchiCegarLoop]: Abstraction has 113 states and 128 transitions. [2022-07-22 01:36:24,350 INFO L287 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-22 01:36:24,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 128 transitions. [2022-07-22 01:36:24,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:24,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:24,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:24,351 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:24,351 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:24,351 INFO L752 eck$LassoCheckResult]: Stem: 5480#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5456#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 5457#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 5440#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 5441#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5525#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 5524#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 5523#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 5522#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 5520#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 5518#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 5517#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 5516#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 5515#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 5514#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5513#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5512#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 5511#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 5510#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5505#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 5508#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 5504#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5502#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5499#L510-5 strlen_#res#1 := strlen_~i~0#1; 5497#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 5496#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5495#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5494#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 5486#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 5487#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5467#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5539#L510-11 strlen_#res#1 := strlen_~i~0#1; 5538#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 5537#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 5536#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 5535#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 5533#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 5532#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5530#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 5531#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 5529#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5528#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 5527#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 5484#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 5485#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 5521#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 5519#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 5506#L533 assume !strstr_#t~short17#1; 5503#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 5500#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 5498#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 5482#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 5475#L518-3 [2022-07-22 01:36:24,351 INFO L754 eck$LassoCheckResult]: Loop: 5475#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5490#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 5474#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 5475#L518-3 [2022-07-22 01:36:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash 283927796, now seen corresponding path program 2 times [2022-07-22 01:36:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:24,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378092856] [2022-07-22 01:36:24,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 01:36:24,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:24,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378092856] [2022-07-22 01:36:24,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378092856] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:24,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633938638] [2022-07-22 01:36:24,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:36:24,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:24,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:24,536 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:24,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2022-07-22 01:36:24,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:36:24,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:36:24,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 01:36:24,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:24,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 01:36:24,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:36:24,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-22 01:36:24,732 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 01:36:24,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 01:36:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 01:36:24,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:36:25,109 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 01:36:25,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-22 01:36:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 01:36:25,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633938638] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:36:25,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:36:25,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-22 01:36:25,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976426286] [2022-07-22 01:36:25,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:36:25,186 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:25,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 8 times [2022-07-22 01:36:25,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:25,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254082436] [2022-07-22 01:36:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:25,191 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:25,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:25,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:25,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 01:36:25,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2022-07-22 01:36:25,298 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. cyclomatic complexity: 26 Second operand has 28 states, 28 states have (on average 4.142857142857143) internal successors, (116), 28 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:26,268 INFO L93 Difference]: Finished difference Result 310 states and 349 transitions. [2022-07-22 01:36:26,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-22 01:36:26,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 349 transitions. [2022-07-22 01:36:26,272 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-07-22 01:36:26,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 235 states and 271 transitions. [2022-07-22 01:36:26,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2022-07-22 01:36:26,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2022-07-22 01:36:26,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 271 transitions. [2022-07-22 01:36:26,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:26,274 INFO L369 hiAutomatonCegarLoop]: Abstraction has 235 states and 271 transitions. [2022-07-22 01:36:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 271 transitions. [2022-07-22 01:36:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 100. [2022-07-22 01:36:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.13) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:26,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-22 01:36:26,277 INFO L392 hiAutomatonCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-22 01:36:26,277 INFO L374 stractBuchiCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-22 01:36:26,277 INFO L287 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-22 01:36:26,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 113 transitions. [2022-07-22 01:36:26,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:26,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:26,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:26,278 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:26,278 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:26,279 INFO L752 eck$LassoCheckResult]: Stem: 6296#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 6271#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 6255#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 6256#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6257#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 6258#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6259#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 6268#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 6269#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 6260#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 6261#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6262#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 6263#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6314#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 6264#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 6265#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6274#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6275#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6286#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6276#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6277#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6305#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6315#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6316#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6312#L510-5 strlen_#res#1 := strlen_~i~0#1; 6313#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 6287#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6288#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6324#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6302#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6281#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6282#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6285#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6321#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6283#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6284#L510-11 strlen_#res#1 := strlen_~i~0#1; 6289#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 6278#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 6272#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 6273#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 6309#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 6307#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6308#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 6292#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 6293#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6346#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 6343#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 6326#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 6323#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 6322#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 6320#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 6298#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 6291#L518-3 [2022-07-22 01:36:26,279 INFO L754 eck$LassoCheckResult]: Loop: 6291#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6306#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 6290#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 6291#L518-3 [2022-07-22 01:36:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash -131927407, now seen corresponding path program 2 times [2022-07-22 01:36:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:26,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991366207] [2022-07-22 01:36:26,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 01:36:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:26,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991366207] [2022-07-22 01:36:26,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991366207] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:26,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801771701] [2022-07-22 01:36:26,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:36:26,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:26,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:26,467 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:26,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2022-07-22 01:36:26,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:36:26,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:36:26,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 01:36:26,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 01:36:26,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:36:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 01:36:27,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801771701] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:36:27,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:36:27,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2022-07-22 01:36:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147132783] [2022-07-22 01:36:27,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:36:27,089 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 9 times [2022-07-22 01:36:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:27,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467785645] [2022-07-22 01:36:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:27,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:27,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:27,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:27,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 01:36:27,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2022-07-22 01:36:27,201 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. cyclomatic complexity: 22 Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:27,509 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2022-07-22 01:36:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 01:36:27,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 254 transitions. [2022-07-22 01:36:27,510 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-07-22 01:36:27,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 202 states and 232 transitions. [2022-07-22 01:36:27,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2022-07-22 01:36:27,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2022-07-22 01:36:27,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 232 transitions. [2022-07-22 01:36:27,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:27,512 INFO L369 hiAutomatonCegarLoop]: Abstraction has 202 states and 232 transitions. [2022-07-22 01:36:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 232 transitions. [2022-07-22 01:36:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 103. [2022-07-22 01:36:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-07-22 01:36:27,515 INFO L392 hiAutomatonCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-07-22 01:36:27,515 INFO L374 stractBuchiCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-07-22 01:36:27,515 INFO L287 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-07-22 01:36:27,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 116 transitions. [2022-07-22 01:36:27,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:27,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:27,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:27,516 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:27,516 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:27,517 INFO L752 eck$LassoCheckResult]: Stem: 6975#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6949#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 6950#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 6934#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 6935#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6936#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 6937#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6938#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 6947#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 6948#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 6939#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 6940#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6941#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 6942#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6989#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 6943#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 6944#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6953#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6954#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6966#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6955#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6956#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6984#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6990#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6982#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6983#L510-5 strlen_#res#1 := strlen_~i~0#1; 6945#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 6946#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6967#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6964#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6965#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6981#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6998#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7005#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6960#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6961#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 6993#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 6992#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6962#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6963#L510-11 strlen_#res#1 := strlen_~i~0#1; 6968#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 6957#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 6951#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 6952#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 6988#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 6986#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6987#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 6971#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 6972#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7028#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7024#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7007#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 6997#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 6995#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 6994#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 6977#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 6970#L518-3 [2022-07-22 01:36:27,517 INFO L754 eck$LassoCheckResult]: Loop: 6970#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6985#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 6969#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 6970#L518-3 [2022-07-22 01:36:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1303219306, now seen corresponding path program 3 times [2022-07-22 01:36:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:27,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679732771] [2022-07-22 01:36:27,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 01:36:27,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:27,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679732771] [2022-07-22 01:36:27,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679732771] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:27,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785762423] [2022-07-22 01:36:27,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 01:36:27,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:27,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:27,720 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:27,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2022-07-22 01:36:27,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 01:36:27,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:36:27,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-22 01:36:27,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:27,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 01:36:27,950 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 01:36:27,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-22 01:36:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 01:36:28,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:36:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 01:36:28,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785762423] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:36:28,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:36:28,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 40 [2022-07-22 01:36:28,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827558936] [2022-07-22 01:36:28,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:36:28,780 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 10 times [2022-07-22 01:36:28,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:28,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058642276] [2022-07-22 01:36:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:28,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:28,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:28,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-22 01:36:28,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 01:36:28,872 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. cyclomatic complexity: 22 Second operand has 40 states, 40 states have (on average 2.55) internal successors, (102), 40 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:29,360 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2022-07-22 01:36:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 01:36:29,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 236 transitions. [2022-07-22 01:36:29,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:29,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 186 states and 206 transitions. [2022-07-22 01:36:29,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2022-07-22 01:36:29,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2022-07-22 01:36:29,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 206 transitions. [2022-07-22 01:36:29,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:29,363 INFO L369 hiAutomatonCegarLoop]: Abstraction has 186 states and 206 transitions. [2022-07-22 01:36:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 206 transitions. [2022-07-22 01:36:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 135. [2022-07-22 01:36:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 135 states have (on average 1.125925925925926) internal successors, (152), 134 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2022-07-22 01:36:29,366 INFO L392 hiAutomatonCegarLoop]: Abstraction has 135 states and 152 transitions. [2022-07-22 01:36:29,366 INFO L374 stractBuchiCegarLoop]: Abstraction has 135 states and 152 transitions. [2022-07-22 01:36:29,366 INFO L287 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-07-22 01:36:29,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 152 transitions. [2022-07-22 01:36:29,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:29,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:29,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:29,367 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:29,367 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:29,367 INFO L752 eck$LassoCheckResult]: Stem: 7688#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7666#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 7667#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 7648#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 7649#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7650#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 7651#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7769#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 7662#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 7663#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 7652#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 7653#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7654#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 7655#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7733#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 7658#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7659#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7668#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7669#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7680#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7670#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7671#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7778#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7777#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7775#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7776#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7774#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7773#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7772#L510-5 strlen_#res#1 := strlen_~i~0#1; 7771#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 7770#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7767#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7765#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7763#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7737#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7738#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 7694#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 7695#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7677#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7678#L510-11 strlen_#res#1 := strlen_~i~0#1; 7681#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 7704#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 7732#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 7701#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 7702#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7730#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7720#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7729#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7718#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7719#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7711#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7710#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 7708#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 7706#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 7705#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 7690#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 7683#L518-3 [2022-07-22 01:36:29,368 INFO L754 eck$LassoCheckResult]: Loop: 7683#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7698#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 7682#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 7683#L518-3 [2022-07-22 01:36:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1792797110, now seen corresponding path program 4 times [2022-07-22 01:36:29,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:29,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683162602] [2022-07-22 01:36:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 01:36:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:29,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683162602] [2022-07-22 01:36:29,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683162602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:29,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149881055] [2022-07-22 01:36:29,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 01:36:29,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:29,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:29,475 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:29,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2022-07-22 01:36:29,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 01:36:29,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:36:29,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 01:36:29,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:29,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 01:36:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 01:36:29,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:36:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 01:36:29,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149881055] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:36:29,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:36:29,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 23 [2022-07-22 01:36:29,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264208620] [2022-07-22 01:36:29,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:36:29,843 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 11 times [2022-07-22 01:36:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:29,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101520560] [2022-07-22 01:36:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:29,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:29,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:29,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 01:36:29,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-07-22 01:36:29,951 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. cyclomatic complexity: 28 Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:30,116 INFO L93 Difference]: Finished difference Result 211 states and 235 transitions. [2022-07-22 01:36:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 01:36:30,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 235 transitions. [2022-07-22 01:36:30,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-22 01:36:30,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 196 states and 220 transitions. [2022-07-22 01:36:30,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2022-07-22 01:36:30,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2022-07-22 01:36:30,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2022-07-22 01:36:30,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:30,119 INFO L369 hiAutomatonCegarLoop]: Abstraction has 196 states and 220 transitions. [2022-07-22 01:36:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2022-07-22 01:36:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 148. [2022-07-22 01:36:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 147 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2022-07-22 01:36:30,122 INFO L392 hiAutomatonCegarLoop]: Abstraction has 148 states and 166 transitions. [2022-07-22 01:36:30,122 INFO L374 stractBuchiCegarLoop]: Abstraction has 148 states and 166 transitions. [2022-07-22 01:36:30,122 INFO L287 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-07-22 01:36:30,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 166 transitions. [2022-07-22 01:36:30,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:30,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:30,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:30,124 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:30,124 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:30,124 INFO L752 eck$LassoCheckResult]: Stem: 8403#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8379#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 8360#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 8361#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8362#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 8363#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8424#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 8425#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 8443#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 8366#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 8367#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 8368#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 8369#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 8466#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 8463#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 8462#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 8372#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 8373#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8458#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8457#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 8456#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 8455#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8454#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 8453#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 8452#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8450#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 8451#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 8449#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8448#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 8447#L510-5 strlen_#res#1 := strlen_~i~0#1; 8446#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 8444#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8445#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8426#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 8427#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 8440#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8442#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 8410#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 8411#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8389#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 8390#L510-11 strlen_#res#1 := strlen_~i~0#1; 8396#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 8384#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 8376#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 8377#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 8419#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 8501#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8500#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 8399#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 8400#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8421#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 8422#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 8469#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 8467#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 8464#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 8461#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 8406#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 8398#L518-3 [2022-07-22 01:36:30,124 INFO L754 eck$LassoCheckResult]: Loop: 8398#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8416#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 8397#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 8398#L518-3 [2022-07-22 01:36:30,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash -2019938312, now seen corresponding path program 5 times [2022-07-22 01:36:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:30,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391270575] [2022-07-22 01:36:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:36:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 01:36:30,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:36:30,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391270575] [2022-07-22 01:36:30,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391270575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:36:30,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014707425] [2022-07-22 01:36:30,328 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 01:36:30,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:36:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:36:30,332 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:36:30,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2022-07-22 01:36:30,462 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 01:36:30,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:36:30,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 01:36:30,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:36:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 01:36:30,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:36:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-22 01:36:30,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014707425] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:36:30,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:36:30,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2022-07-22 01:36:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904046619] [2022-07-22 01:36:30,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:36:30,925 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:36:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 12 times [2022-07-22 01:36:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:30,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536954331] [2022-07-22 01:36:30,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:30,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:30,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:31,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:36:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-22 01:36:31,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2022-07-22 01:36:31,033 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. cyclomatic complexity: 29 Second operand has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:36:31,464 INFO L93 Difference]: Finished difference Result 399 states and 457 transitions. [2022-07-22 01:36:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 01:36:31,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 457 transitions. [2022-07-22 01:36:31,466 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2022-07-22 01:36:31,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 391 states and 448 transitions. [2022-07-22 01:36:31,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2022-07-22 01:36:31,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-07-22 01:36:31,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 391 states and 448 transitions. [2022-07-22 01:36:31,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:36:31,469 INFO L369 hiAutomatonCegarLoop]: Abstraction has 391 states and 448 transitions. [2022-07-22 01:36:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states and 448 transitions. [2022-07-22 01:36:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 170. [2022-07-22 01:36:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 170 states have (on average 1.1235294117647059) internal successors, (191), 169 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:36:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2022-07-22 01:36:31,472 INFO L392 hiAutomatonCegarLoop]: Abstraction has 170 states and 191 transitions. [2022-07-22 01:36:31,473 INFO L374 stractBuchiCegarLoop]: Abstraction has 170 states and 191 transitions. [2022-07-22 01:36:31,473 INFO L287 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-07-22 01:36:31,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 191 transitions. [2022-07-22 01:36:31,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-22 01:36:31,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:36:31,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:36:31,474 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:36:31,474 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:36:31,474 INFO L752 eck$LassoCheckResult]: Stem: 9337#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~nondet22#1, main_#t~post21#1, main_~i~2#1, main_#t~nondet23#1, main_#t~malloc24#1.base, main_#t~malloc24#1.offset, main_#t~nondet26#1, main_#t~post25#1, main_~i~3#1, main_#t~ret27#1.base, main_#t~ret27#1.offset, main_~in_len~0#1, main_~hay~0#1.base, main_~hay~0#1.offset, main_~out_len~0#1, main_~needle~0#1.base, main_~needle~0#1.offset;main_~in_len~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 9309#L542 assume !(main_~in_len~0#1 < 1);call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1);main_~hay~0#1.base, main_~hay~0#1.offset := main_#t~malloc20#1.base, main_#t~malloc20#1.offset;main_~i~2#1 := 0; 9293#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 9294#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9295#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 9296#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9297#L544-3 assume !!(main_~i~2#1 < main_~in_len~0#1 - 1);call write~int(main_#t~nondet22#1, main_~hay~0#1.base, main_~hay~0#1.offset + main_~i~2#1, 1);havoc main_#t~nondet22#1; 9361#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 9359#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 9360#L544-4 call write~int(0, main_~hay~0#1.base, main_~hay~0#1.offset + (main_~in_len~0#1 - 1), 1);main_~out_len~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1; 9357#L550 assume !(main_~out_len~0#1 < 1);call main_#t~malloc24#1.base, main_#t~malloc24#1.offset := #Ultimate.allocOnStack(main_~out_len~0#1);main_~needle~0#1.base, main_~needle~0#1.offset := main_#t~malloc24#1.base, main_#t~malloc24#1.offset;main_~i~3#1 := 0; 9358#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 9373#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 9372#L552-3 assume !!(main_~i~3#1 < main_~out_len~0#1 - 1);call write~int(main_#t~nondet26#1, main_~needle~0#1.base, main_~needle~0#1.offset + main_~i~3#1, 1);havoc main_#t~nondet26#1; 9371#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 9369#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 9368#L552-4 call write~int(0, main_~needle~0#1.base, main_~needle~0#1.offset + (main_~out_len~0#1 - 1), 1);assume { :begin_inline_strstr } true;strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset, strstr_#in~needle#1.base, strstr_#in~needle#1.offset := main_~hay~0#1.base, main_~hay~0#1.offset, main_~needle~0#1.base, main_~needle~0#1.offset;havoc strstr_#res#1.base, strstr_#res#1.offset;havoc strstr_#t~ret11#1, strstr_#t~ret12#1, strstr_#t~mem14#1, strstr_#t~mem15#1, strstr_#t~ret16#1, strstr_#t~short17#1, strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset, strstr_#t~pre13#1, strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1, strstr_~hl~0#1, strstr_~i~1#1;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_#in~haystack#1.base, strstr_#in~haystack#1.offset;strstr_~needle#1.base, strstr_~needle#1.offset := strstr_#in~needle#1.base, strstr_#in~needle#1.offset;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~needle#1.base, strstr_~needle#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 9366#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 9367#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9362#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 9363#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 9364#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9365#L510-1 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 9324#L510-3 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 9325#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9406#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 9442#L510-5 strlen_#res#1 := strlen_~i~0#1; 9441#L511 strstr_#t~ret11#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~nl~0#1 := strstr_#t~ret11#1;havoc strstr_#t~ret11#1;assume { :begin_inline_strlen } true;strlen_#in~s#1.base, strlen_#in~s#1.offset := strstr_~haystack#1.base, strstr_~haystack#1.offset;havoc strlen_#res#1;havoc strlen_#t~pre3#1, strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset, strlen_#t~mem4#1, strlen_~s#1.base, strlen_~s#1.offset, strlen_~i~0#1;strlen_~s#1.base, strlen_~s#1.offset := strlen_#in~s#1.base, strlen_#in~s#1.offset;havoc strlen_~i~0#1; 9440#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 9317#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9318#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 9449#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 9448#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9447#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 9346#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 9319#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9320#L510-7 assume !!(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1;strlen_#t~pre3#1 := 1 + strlen_~i~0#1;strlen_~i~0#1 := 1 + strlen_~i~0#1;havoc strlen_#t~pre3#1; 9323#L510-9 strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;strlen_~s#1.base, strlen_~s#1.offset := strlen_~s#1.base, 1 + strlen_~s#1.offset;havoc strlen_#t~pre2#1.base, strlen_#t~pre2#1.offset; 9446#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 9321#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 9322#L510-11 strlen_#res#1 := strlen_~i~0#1; 9330#L511-1 strstr_#t~ret12#1 := strlen_#res#1;assume { :end_inline_strlen } true;strstr_~hl~0#1 := strstr_#t~ret12#1;havoc strstr_#t~ret12#1;havoc strstr_~i~1#1; 9316#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 9310#L531 assume !(strstr_~nl~0#1 % 18446744073709551616 > strstr_~hl~0#1 % 18446744073709551616);strstr_~i~1#1 := 1 + (strstr_~hl~0#1 - strstr_~nl~0#1); 9311#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 9354#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 9352#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9353#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 9333#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 9334#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9457#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 9450#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 9416#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 9414#L533-2 assume !strstr_#t~short17#1;havoc strstr_#t~mem14#1;havoc strstr_#t~mem15#1;havoc strstr_#t~ret16#1;havoc strstr_#t~short17#1;strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;strstr_~haystack#1.base, strstr_~haystack#1.offset := strstr_~haystack#1.base, 1 + strstr_~haystack#1.offset;havoc strstr_#t~pre18#1.base, strstr_#t~pre18#1.offset; 9412#L532-2 strstr_#t~pre13#1 := strstr_~i~1#1 - 1;strstr_~i~1#1 := strstr_~i~1#1 - 1;havoc strstr_#t~pre13#1; 9411#L532-3 assume !!(0 != strstr_~i~1#1 % 18446744073709551616);call strstr_#t~mem14#1 := read~int(strstr_~haystack#1.base, strstr_~haystack#1.offset, 1);call strstr_#t~mem15#1 := read~int(strstr_~needle#1.base, strstr_~needle#1.offset, 1);strstr_#t~short17#1 := strstr_#t~mem14#1 == strstr_#t~mem15#1; 9339#L533 assume strstr_#t~short17#1;assume { :begin_inline_memcmp } true;memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset, memcmp_#in~src#1.base, memcmp_#in~src#1.offset, memcmp_#in~count#1 := strstr_~haystack#1.base, strstr_~haystack#1.offset, strstr_~needle#1.base, strstr_~needle#1.offset, strstr_~nl~0#1;havoc memcmp_#res#1;havoc memcmp_#t~pre5#1, memcmp_#t~mem7#1, memcmp_#t~mem8#1, memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset, memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset, memcmp_#t~pre6#1, memcmp_~dst#1.base, memcmp_~dst#1.offset, memcmp_~src#1.base, memcmp_~src#1.offset, memcmp_~count#1, memcmp_~r~0#1, memcmp_~d~0#1.base, memcmp_~d~0#1.offset, memcmp_~s~0#1.base, memcmp_~s~0#1.offset;memcmp_~dst#1.base, memcmp_~dst#1.offset := memcmp_#in~dst#1.base, memcmp_#in~dst#1.offset;memcmp_~src#1.base, memcmp_~src#1.offset := memcmp_#in~src#1.base, memcmp_#in~src#1.offset;memcmp_~count#1 := memcmp_#in~count#1;havoc memcmp_~r~0#1;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~dst#1.base, memcmp_~dst#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~src#1.base, memcmp_~src#1.offset;memcmp_#t~pre5#1 := 1 + memcmp_~count#1;memcmp_~count#1 := 1 + memcmp_~count#1;havoc memcmp_#t~pre5#1; 9332#L518-3 [2022-07-22 01:36:31,475 INFO L754 eck$LassoCheckResult]: Loop: 9332#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 9351#L518-1 assume !!(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1;call memcmp_#t~mem7#1 := read~int(memcmp_~d~0#1.base, memcmp_~d~0#1.offset, 1);call memcmp_#t~mem8#1 := read~int(memcmp_~s~0#1.base, memcmp_~s~0#1.offset, 1);memcmp_~r~0#1 := memcmp_#t~mem7#1 % 256 - memcmp_#t~mem8#1 % 256; 9331#L519 assume !(0 != memcmp_~r~0#1);havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;memcmp_~d~0#1.base, memcmp_~d~0#1.offset := memcmp_~d~0#1.base, 1 + memcmp_~d~0#1.offset;havoc memcmp_#t~pre9#1.base, memcmp_#t~pre9#1.offset;memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;memcmp_~s~0#1.base, memcmp_~s~0#1.offset := memcmp_~s~0#1.base, 1 + memcmp_~s~0#1.offset;havoc memcmp_#t~pre10#1.base, memcmp_#t~pre10#1.offset; 9332#L518-3 [2022-07-22 01:36:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:31,475 INFO L85 PathProgramCache]: Analyzing trace with hash 259249140, now seen corresponding path program 6 times [2022-07-22 01:36:31,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:31,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980048606] [2022-07-22 01:36:31,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:31,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:31,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:31,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:31,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 13 times [2022-07-22 01:36:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:31,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687316806] [2022-07-22 01:36:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:31,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:31,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:36:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash 940040927, now seen corresponding path program 7 times [2022-07-22 01:36:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:36:31,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13781446] [2022-07-22 01:36:31,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:36:31,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:36:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:31,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:36:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:36:31,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:36:39,773 WARN L233 SmtUtils]: Spent 7.95s on a formula simplification. DAG size of input: 553 DAG size of output: 389 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-22 01:36:40,686 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:36:40,686 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:36:40,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:36:40,686 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:36:40,686 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:36:40,686 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:36:40,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:36:40,686 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:36:40,686 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration24_Lasso [2022-07-22 01:36:40,686 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:36:40,686 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:36:40,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:40,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:36:42,333 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 01:36:42,336 INFO L158 Benchmark]: Toolchain (without parser) took 49988.95ms. Allocated memory was 56.6MB in the beginning and 211.8MB in the end (delta: 155.2MB). Free memory was 34.0MB in the beginning and 99.7MB in the end (delta: -65.7MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. [2022-07-22 01:36:42,337 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:36:42,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.60ms. Allocated memory is still 56.6MB. Free memory was 33.7MB in the beginning and 33.6MB in the end (delta: 83.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 01:36:42,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.04ms. Allocated memory is still 56.6MB. Free memory was 33.4MB in the beginning and 31.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:36:42,337 INFO L158 Benchmark]: Boogie Preprocessor took 30.24ms. Allocated memory is still 56.6MB. Free memory was 31.1MB in the beginning and 29.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:36:42,337 INFO L158 Benchmark]: RCFGBuilder took 483.01ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 29.4MB in the beginning and 42.3MB in the end (delta: -12.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-07-22 01:36:42,338 INFO L158 Benchmark]: BuchiAutomizer took 49044.84ms. Allocated memory was 69.2MB in the beginning and 211.8MB in the end (delta: 142.6MB). Free memory was 42.3MB in the beginning and 99.7MB in the end (delta: -57.4MB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. [2022-07-22 01:36:42,339 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.20ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.60ms. Allocated memory is still 56.6MB. Free memory was 33.7MB in the beginning and 33.6MB in the end (delta: 83.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.04ms. Allocated memory is still 56.6MB. Free memory was 33.4MB in the beginning and 31.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.24ms. Allocated memory is still 56.6MB. Free memory was 31.1MB in the beginning and 29.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 483.01ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 29.4MB in the beginning and 42.3MB in the end (delta: -12.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 49044.84ms. Allocated memory was 69.2MB in the beginning and 211.8MB in the end (delta: 142.6MB). Free memory was 42.3MB in the beginning and 99.7MB in the end (delta: -57.4MB). Peak memory consumption was 136.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 01:36:42,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:42,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:42,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Ended with exit code 0 [2022-07-22 01:36:42,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Ended with exit code 0 [2022-07-22 01:36:43,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Ended with exit code 0 [2022-07-22 01:36:43,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Ended with exit code 0 [2022-07-22 01:36:43,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Ended with exit code 0 [2022-07-22 01:36:43,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Ended with exit code 0 [2022-07-22 01:36:43,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:44,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-07-22 01:36:44,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null