./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 3a877d22 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-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:01:01,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:01:01,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:01:01,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:01:01,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:01:01,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:01:01,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:01:01,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:01:01,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:01:01,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:01:01,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:01:01,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:01:01,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:01:01,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:01:01,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:01:01,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:01:01,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:01:01,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:01:01,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:01:01,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:01:01,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:01:01,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:01:01,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:01:01,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:01:01,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:01:01,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:01:01,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:01:01,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:01:01,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:01:01,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:01:01,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:01:01,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:01:01,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:01:01,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:01:01,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:01:01,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:01:01,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:01:01,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:01:01,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:01:01,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:01:01,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:01:01,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 17:01:01,658 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:01:01,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:01:01,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:01:01,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:01:01,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:01:01,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:01:01,665 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:01:01,665 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:01:01,665 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:01:01,665 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:01:01,666 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:01:01,666 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:01:01,666 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:01:01,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:01:01,666 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:01:01,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:01:01,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:01:01,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:01:01,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:01:01,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:01:01,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:01:01,668 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:01:01,668 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:01:01,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:01:01,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:01:01,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:01:01,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:01:01,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:01:01,669 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:01:01,670 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:01:01,670 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 [2021-12-15 17:01:01,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:01:01,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:01:01,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:01:01,946 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:01:01,946 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:01:01,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strstr.i [2021-12-15 17:01:01,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e7c1186/ecaee3b01cd24b62b42beec6bfc7bb8d/FLAG215d554a0 [2021-12-15 17:01:02,330 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:01:02,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2021-12-15 17:01:02,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e7c1186/ecaee3b01cd24b62b42beec6bfc7bb8d/FLAG215d554a0 [2021-12-15 17:01:02,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e7c1186/ecaee3b01cd24b62b42beec6bfc7bb8d [2021-12-15 17:01:02,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:01:02,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:01:02,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:01:02,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:01:02,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:01:02,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:01:02" (1/1) ... [2021-12-15 17:01:02,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c412f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:02, skipping insertion in model container [2021-12-15 17:01:02,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:01:02" (1/1) ... [2021-12-15 17:01:02,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:01:02,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:01:03,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:01:03,075 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:01:03,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:01:03,121 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:01:03,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03 WrapperNode [2021-12-15 17:01:03,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:01:03,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:01:03,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:01:03,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:01:03,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,174 INFO L137 Inliner]: procedures = 116, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 177 [2021-12-15 17:01:03,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:01:03,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:01:03,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:01:03,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:01:03,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:01:03,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:01:03,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:01:03,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:01:03,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (1/1) ... [2021-12-15 17:01:03,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:03,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:03,262 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) [2021-12-15 17:01:03,266 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 [2021-12-15 17:01:03,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:01:03,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:01:03,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:01:03,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:01:03,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:01:03,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:01:03,388 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:01:03,404 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:01:03,598 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:01:03,602 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:01:03,611 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-15 17:01:03,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:01:03 BoogieIcfgContainer [2021-12-15 17:01:03,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:01:03,613 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:01:03,614 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:01:03,616 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:01:03,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:01:03,617 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:01:02" (1/3) ... [2021-12-15 17:01:03,618 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d97cf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:01:03, skipping insertion in model container [2021-12-15 17:01:03,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:01:03,618 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:01:03" (2/3) ... [2021-12-15 17:01:03,619 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d97cf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:01:03, skipping insertion in model container [2021-12-15 17:01:03,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:01:03,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:01:03" (3/3) ... [2021-12-15 17:01:03,620 INFO L388 chiAutomizerObserver]: Analyzing ICFG strstr.i [2021-12-15 17:01:03,660 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:01:03,660 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:01:03,660 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:01:03,660 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:01:03,660 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:01:03,661 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:01:03,661 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:01:03,661 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:01:03,678 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) [2021-12-15 17:01:03,695 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2021-12-15 17:01:03,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:03,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:03,699 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-15 17:01:03,699 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:01:03,700 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:01:03,700 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) [2021-12-15 17:01:03,705 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2021-12-15 17:01:03,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:03,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:03,706 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-15 17:01:03,706 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:01:03,711 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#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; 12#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; 4#L544-3true [2021-12-15 17:01:03,712 INFO L793 eck$LassoCheckResult]: Loop: 4#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; 5#L544-2true main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4#L544-3true [2021-12-15 17:01:03,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2021-12-15 17:01:03,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:03,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310531696] [2021-12-15 17:01:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:03,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:03,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:03,854 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2021-12-15 17:01:03,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:03,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840210086] [2021-12-15 17:01:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:03,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:03,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:03,889 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2021-12-15 17:01:03,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:03,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297630004] [2021-12-15 17:01:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:03,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:03,917 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:03,941 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:04,137 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:04,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:04,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:04,138 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:04,138 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:04,138 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,138 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:04,138 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:04,138 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2021-12-15 17:01:04,139 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:04,139 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:04,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:04,428 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:04,431 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:04,432 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,450 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) [2021-12-15 17:01:04,451 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 [2021-12-15 17:01:04,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 [2021-12-15 17:01:04,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,515 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 [2021-12-15 17:01:04,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,519 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) [2021-12-15 17:01:04,531 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 [2021-12-15 17:01:04,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 [2021-12-15 17:01:04,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,569 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 [2021-12-15 17:01:04,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,570 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) [2021-12-15 17:01:04,571 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 [2021-12-15 17:01:04,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:04,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:04,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:04,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,615 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 [2021-12-15 17:01:04,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,632 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) [2021-12-15 17:01:04,653 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 [2021-12-15 17:01:04,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 [2021-12-15 17:01:04,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:04,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,688 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) [2021-12-15 17:01:04,689 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 [2021-12-15 17:01:04,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:04,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,714 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 [2021-12-15 17:01:04,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,716 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) [2021-12-15 17:01:04,718 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 [2021-12-15 17:01:04,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:04,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:04,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,748 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) [2021-12-15 17:01:04,749 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 [2021-12-15 17:01:04,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:04,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,790 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 [2021-12-15 17:01:04,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,792 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) [2021-12-15 17:01:04,792 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 [2021-12-15 17:01:04,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 [2021-12-15 17:01:04,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,830 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 [2021-12-15 17:01:04,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,832 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) [2021-12-15 17:01:04,832 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 [2021-12-15 17:01:04,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:04,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,858 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 [2021-12-15 17:01:04,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,859 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) [2021-12-15 17:01:04,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-15 17:01:04,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 [2021-12-15 17:01:04,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,884 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 [2021-12-15 17:01:04,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,891 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) [2021-12-15 17:01:04,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:04,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,906 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 [2021-12-15 17:01:04,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,930 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 [2021-12-15 17:01:04,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,932 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) [2021-12-15 17:01:04,937 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 [2021-12-15 17:01:04,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 [2021-12-15 17:01:04,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:04,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:04,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:04,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:04,969 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 [2021-12-15 17:01:04,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:04,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:04,970 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) [2021-12-15 17:01:04,971 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 [2021-12-15 17:01:04,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:04,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:04,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:04,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:04,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:04,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:04,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:04,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:05,009 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 [2021-12-15 17:01:05,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:05,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:05,011 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) [2021-12-15 17:01:05,012 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 [2021-12-15 17:01:05,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:05,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:05,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:05,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:05,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:05,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:05,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:05,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:05,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:05,035 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 [2021-12-15 17:01:05,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:05,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:05,036 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) [2021-12-15 17:01:05,037 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 [2021-12-15 17:01:05,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:05,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:05,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:05,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:05,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:05,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:05,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:05,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:05,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:05,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-15 17:01:05,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:05,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:05,062 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) [2021-12-15 17:01:05,063 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 [2021-12-15 17:01:05,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:05,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:05,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:05,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:05,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:05,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:05,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:05,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:05,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:05,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:05,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:05,117 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) [2021-12-15 17:01:05,118 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 [2021-12-15 17:01:05,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:05,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:05,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:05,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:05,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:05,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:05,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:05,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:05,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-15 17:01:05,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:05,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:05,168 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) [2021-12-15 17:01:05,170 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 [2021-12-15 17:01:05,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:05,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:05,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:05,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:05,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:05,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:05,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:05,205 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:05,229 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2021-12-15 17:01:05,230 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-15 17:01:05,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:05,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:05,232 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) [2021-12-15 17:01:05,241 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:05,256 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 [2021-12-15 17:01:05,259 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:01:05,259 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:05,260 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_~hay~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~hay~0#1.base)_1 - 1*ULTIMATE.start_main_~i~2#1 - 1*ULTIMATE.start_main_~hay~0#1.offset Supporting invariants [] [2021-12-15 17:01:05,277 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 [2021-12-15 17:01:05,283 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-12-15 17:01:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:05,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:05,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:05,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:01:05,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:05,386 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 [2021-12-15 17:01:05,387 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) [2021-12-15 17:01:05,420 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 86 states and 125 transitions. Complement of second has 8 states. [2021-12-15 17:01:05,421 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 [2021-12-15 17:01:05,424 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) [2021-12-15 17:01:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2021-12-15 17:01:05,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 3 letters. Loop has 2 letters. [2021-12-15 17:01:05,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:05,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 5 letters. Loop has 2 letters. [2021-12-15 17:01:05,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:05,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 3 letters. Loop has 4 letters. [2021-12-15 17:01:05,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:05,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 125 transitions. [2021-12-15 17:01:05,429 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-12-15 17:01:05,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 34 states and 48 transitions. [2021-12-15 17:01:05,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-12-15 17:01:05,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2021-12-15 17:01:05,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 48 transitions. [2021-12-15 17:01:05,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:01:05,433 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-12-15 17:01:05,465 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 [2021-12-15 17:01:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 48 transitions. [2021-12-15 17:01:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-15 17:01:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.411764705882353) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-12-15 17:01:05,478 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-12-15 17:01:05,478 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-12-15 17:01:05,478 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:01:05,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2021-12-15 17:01:05,481 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-12-15 17:01:05,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:05,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:05,481 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:01:05,481 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:01:05,481 INFO L791 eck$LassoCheckResult]: Stem: 211#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 191#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; 192#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; 180#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 181#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; 190#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; 184#L552-3 [2021-12-15 17:01:05,481 INFO L793 eck$LassoCheckResult]: Loop: 184#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; 186#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 184#L552-3 [2021-12-15 17:01:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash 889572430, now seen corresponding path program 1 times [2021-12-15 17:01:05,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:05,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699110835] [2021-12-15 17:01:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:05,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:05,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:05,503 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:05,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2051, now seen corresponding path program 1 times [2021-12-15 17:01:05,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:05,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767441739] [2021-12-15 17:01:05,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:05,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:05,508 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:05,512 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash 180614416, now seen corresponding path program 1 times [2021-12-15 17:01:05,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:05,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604397275] [2021-12-15 17:01:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:05,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:05,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:05,533 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:05,839 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:05,839 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:05,839 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:05,839 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:05,839 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:05,839 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:05,839 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:05,839 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:05,839 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration2_Lasso [2021-12-15 17:01:05,839 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:05,839 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:05,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:05,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:06,200 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:06,200 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:06,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:06,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:06,216 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) [2021-12-15 17:01:06,227 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 [2021-12-15 17:01:06,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:06,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:06,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:06,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:06,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:06,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:06,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:06,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:06,281 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 [2021-12-15 17:01:06,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:06,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:06,300 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) [2021-12-15 17:01:06,315 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 [2021-12-15 17:01:06,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:06,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:06,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:06,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:06,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:06,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:06,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:06,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:06,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:06,354 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 [2021-12-15 17:01:06,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:06,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:06,355 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) [2021-12-15 17:01:06,356 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 [2021-12-15 17:01:06,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:06,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:06,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:06,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:06,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:06,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:06,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:06,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:06,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:06,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:06,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:06,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:06,382 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) [2021-12-15 17:01:06,382 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 [2021-12-15 17:01:06,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:06,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:06,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:06,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:06,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:06,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:06,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:06,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:06,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:06,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:06,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:06,422 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) [2021-12-15 17:01:06,423 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 [2021-12-15 17:01:06,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:06,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:06,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:06,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:06,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:06,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:06,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:06,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:06,465 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 [2021-12-15 17:01:06,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:06,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:06,466 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) [2021-12-15 17:01:06,485 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 [2021-12-15 17:01:06,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:06,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:06,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:06,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:06,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:06,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:06,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:06,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:06,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:06,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:06,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:06,570 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) [2021-12-15 17:01:06,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:06,573 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 [2021-12-15 17:01:06,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:06,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:06,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:06,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:06,585 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:06,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:06,602 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:06,650 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-12-15 17:01:06,650 INFO L444 ModelExtractionUtils]: 8 out of 34 variables were initially zero. Simplification set additionally 23 variables to zero. [2021-12-15 17:01:06,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:06,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:06,652 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) [2021-12-15 17:01:06,655 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 [2021-12-15 17:01:06,655 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:06,670 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:01:06,670 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:06,670 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 [] [2021-12-15 17:01:06,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:06,705 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-12-15 17:01:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:06,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:01:06,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:06,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:01:06,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:06,797 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 [2021-12-15 17:01:06,798 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 48 transitions. cyclomatic complexity: 19 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) [2021-12-15 17:01:06,827 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 48 transitions. cyclomatic complexity: 19. 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 84 states and 120 transitions. Complement of second has 7 states. [2021-12-15 17:01:06,829 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 [2021-12-15 17:01:06,830 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) [2021-12-15 17:01:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2021-12-15 17:01:06,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-15 17:01:06,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:06,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 8 letters. Loop has 2 letters. [2021-12-15 17:01:06,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:06,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-15 17:01:06,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:06,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 120 transitions. [2021-12-15 17:01:06,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-15 17:01:06,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 35 states and 46 transitions. [2021-12-15 17:01:06,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-15 17:01:06,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-15 17:01:06,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2021-12-15 17:01:06,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:01:06,838 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-15 17:01:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2021-12-15 17:01:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-15 17:01:06,840 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) [2021-12-15 17:01:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2021-12-15 17:01:06,840 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-15 17:01:06,840 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-15 17:01:06,840 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:01:06,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2021-12-15 17:01:06,840 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-15 17:01:06,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:06,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:06,841 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:06,841 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:06,841 INFO L791 eck$LassoCheckResult]: Stem: 405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 388#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; 389#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; 374#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 375#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; 385#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; 378#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 379#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; 382#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 390#L510-4 [2021-12-15 17:01:06,841 INFO L793 eck$LassoCheckResult]: Loop: 390#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 391#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; 399#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; 390#L510-4 [2021-12-15 17:01:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1304077847, now seen corresponding path program 1 times [2021-12-15 17:01:06,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:06,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158895378] [2021-12-15 17:01:06,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:06,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:06,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:06,900 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 1 times [2021-12-15 17:01:06,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:06,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226869557] [2021-12-15 17:01:06,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:06,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:06,910 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:06,916 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1803996476, now seen corresponding path program 1 times [2021-12-15 17:01:06,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:06,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26172799] [2021-12-15 17:01:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:06,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:07,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:07,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26172799] [2021-12-15 17:01:07,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26172799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:01:07,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:01:07,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 17:01:07,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831135193] [2021-12-15 17:01:07,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:01:07,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:07,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 17:01:07,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 17:01:07,048 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) [2021-12-15 17:01:07,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:07,149 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2021-12-15 17:01:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:01:07,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2021-12-15 17:01:07,151 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 27 [2021-12-15 17:01:07,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 76 transitions. [2021-12-15 17:01:07,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-12-15 17:01:07,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-12-15 17:01:07,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 76 transitions. [2021-12-15 17:01:07,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:01:07,152 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 76 transitions. [2021-12-15 17:01:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 76 transitions. [2021-12-15 17:01:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2021-12-15 17:01:07,154 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) [2021-12-15 17:01:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2021-12-15 17:01:07,154 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-15 17:01:07,154 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-15 17:01:07,155 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:01:07,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2021-12-15 17:01:07,155 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-15 17:01:07,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:07,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:07,155 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:07,156 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:07,160 INFO L791 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 498#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; 499#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; 485#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 486#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; 497#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; 489#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 490#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; 523#L509 assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0; 495#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; 496#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 505#L510-10 [2021-12-15 17:01:07,160 INFO L793 eck$LassoCheckResult]: Loop: 505#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 506#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; 508#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; 505#L510-10 [2021-12-15 17:01:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -911639398, now seen corresponding path program 1 times [2021-12-15 17:01:07,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:07,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007650828] [2021-12-15 17:01:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:07,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:07,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:07,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007650828] [2021-12-15 17:01:07,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007650828] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:01:07,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:01:07,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:01:07,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608480568] [2021-12-15 17:01:07,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:01:07,215 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 1 times [2021-12-15 17:01:07,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:07,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643462236] [2021-12-15 17:01:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:07,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:07,241 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:07,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:07,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:07,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:01:07,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:01:07,295 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) [2021-12-15 17:01:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:07,309 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2021-12-15 17:01:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:01:07,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2021-12-15 17:01:07,310 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-15 17:01:07,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2021-12-15 17:01:07,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-12-15 17:01:07,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-12-15 17:01:07,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2021-12-15 17:01:07,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:01:07,311 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-12-15 17:01:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2021-12-15 17:01:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-15 17:01:07,313 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) [2021-12-15 17:01:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2021-12-15 17:01:07,313 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-12-15 17:01:07,313 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2021-12-15 17:01:07,313 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:01:07,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 49 transitions. [2021-12-15 17:01:07,314 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2021-12-15 17:01:07,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:07,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:07,314 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:07,314 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:07,314 INFO L791 eck$LassoCheckResult]: Stem: 604#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 585#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; 586#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; 572#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 573#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; 584#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; 576#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; 578#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 579#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 580#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; 581#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 589#L510-4 [2021-12-15 17:01:07,314 INFO L793 eck$LassoCheckResult]: Loop: 589#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 590#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; 598#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; 589#L510-4 [2021-12-15 17:01:07,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash -909922795, now seen corresponding path program 1 times [2021-12-15 17:01:07,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:07,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713872090] [2021-12-15 17:01:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:07,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:07,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:07,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash 78610, now seen corresponding path program 2 times [2021-12-15 17:01:07,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:07,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460839867] [2021-12-15 17:01:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:07,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:07,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:07,336 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1971331970, now seen corresponding path program 1 times [2021-12-15 17:01:07,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:07,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129994499] [2021-12-15 17:01:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:07,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:07,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:07,356 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:08,086 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:08,086 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:08,086 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:08,086 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:08,086 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:08,086 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:08,086 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:08,086 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:08,086 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration5_Lasso [2021-12-15 17:01:08,087 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:08,087 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:08,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:08,961 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:08,961 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:08,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:08,966 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) [2021-12-15 17:01:08,967 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 [2021-12-15 17:01:08,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:08,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:08,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:08,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:08,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:08,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:08,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:08,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:08,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:08,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:08,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:08,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:08,998 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) [2021-12-15 17:01:08,999 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 [2021-12-15 17:01:09,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-15 17:01:09,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,031 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) [2021-12-15 17:01:09,032 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 [2021-12-15 17:01:09,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,057 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 [2021-12-15 17:01:09,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,058 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) [2021-12-15 17:01:09,059 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 [2021-12-15 17:01:09,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-15 17:01:09,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,119 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) [2021-12-15 17:01:09,120 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 [2021-12-15 17:01:09,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,143 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 [2021-12-15 17:01:09,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,144 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) [2021-12-15 17:01:09,145 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 [2021-12-15 17:01:09,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,167 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 [2021-12-15 17:01:09,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,169 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) [2021-12-15 17:01:09,169 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 [2021-12-15 17:01:09,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,192 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 [2021-12-15 17:01:09,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,194 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) [2021-12-15 17:01:09,197 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 [2021-12-15 17:01:09,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,245 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 [2021-12-15 17:01:09,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,246 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) [2021-12-15 17:01:09,247 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 [2021-12-15 17:01:09,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:09,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:09,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,275 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 [2021-12-15 17:01:09,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,276 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) [2021-12-15 17:01:09,277 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 [2021-12-15 17:01:09,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:09,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,325 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) [2021-12-15 17:01:09,326 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 [2021-12-15 17:01:09,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 [2021-12-15 17:01:09,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,368 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 [2021-12-15 17:01:09,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,369 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) [2021-12-15 17:01:09,371 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 [2021-12-15 17:01:09,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:09,396 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,397 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) [2021-12-15 17:01:09,398 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 [2021-12-15 17:01:09,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,423 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 [2021-12-15 17:01:09,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,424 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) [2021-12-15 17:01:09,428 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 [2021-12-15 17:01:09,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:09,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:09,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,482 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 [2021-12-15 17:01:09,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,485 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) [2021-12-15 17:01:09,486 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 [2021-12-15 17:01:09,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-15 17:01:09,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,511 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) [2021-12-15 17:01:09,513 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 [2021-12-15 17:01:09,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,537 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 [2021-12-15 17:01:09,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,539 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) [2021-12-15 17:01:09,541 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 [2021-12-15 17:01:09,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:09,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,571 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) [2021-12-15 17:01:09,572 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 [2021-12-15 17:01:09,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,604 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 [2021-12-15 17:01:09,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,605 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) [2021-12-15 17:01:09,606 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 [2021-12-15 17:01:09,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-15 17:01:09,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,647 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) [2021-12-15 17:01:09,648 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 [2021-12-15 17:01:09,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:09,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,697 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) [2021-12-15 17:01:09,698 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 [2021-12-15 17:01:09,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:09,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:09,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:09,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,726 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) [2021-12-15 17:01:09,727 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 [2021-12-15 17:01:09,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:09,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,767 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) [2021-12-15 17:01:09,768 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 [2021-12-15 17:01:09,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-15 17:01:09,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,808 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) [2021-12-15 17:01:09,809 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 [2021-12-15 17:01:09,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,835 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 [2021-12-15 17:01:09,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,837 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) [2021-12-15 17:01:09,838 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 [2021-12-15 17:01:09,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,862 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 [2021-12-15 17:01:09,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,864 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) [2021-12-15 17:01:09,864 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 [2021-12-15 17:01:09,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:09,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:09,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:09,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,897 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 [2021-12-15 17:01:09,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,900 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) [2021-12-15 17:01:09,901 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 [2021-12-15 17:01:09,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:09,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:09,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,941 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 [2021-12-15 17:01:09,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,947 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) [2021-12-15 17:01:09,948 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 [2021-12-15 17:01:09,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:09,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:09,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:09,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:09,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:09,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:09,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:09,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:09,995 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 [2021-12-15 17:01:09,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:09,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:09,996 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) [2021-12-15 17:01:09,997 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 [2021-12-15 17:01:09,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:10,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:10,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:10,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:10,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:10,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:10,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:10,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:10,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:10,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:10,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:10,030 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) [2021-12-15 17:01:10,031 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 [2021-12-15 17:01:10,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:10,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:10,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:10,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:10,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:10,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:10,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:10,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:10,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:10,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:10,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:10,076 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) [2021-12-15 17:01:10,077 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 [2021-12-15 17:01:10,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:10,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:10,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:10,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:10,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:10,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:10,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:10,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:10,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:10,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:10,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:10,141 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) [2021-12-15 17:01:10,142 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 [2021-12-15 17:01:10,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:10,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:10,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:10,150 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-15 17:01:10,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:10,154 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-15 17:01:10,154 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-15 17:01:10,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:10,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:10,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:10,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:10,189 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) [2021-12-15 17:01:10,190 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 [2021-12-15 17:01:10,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:10,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:10,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:10,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:10,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:10,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:10,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:10,223 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:10,254 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 17:01:10,254 INFO L444 ModelExtractionUtils]: 14 out of 61 variables were initially zero. Simplification set additionally 44 variables to zero. [2021-12-15 17:01:10,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:10,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:10,300 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) [2021-12-15 17:01:10,301 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 [2021-12-15 17:01:10,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:10,323 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:01:10,323 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:10,323 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_2) = -1*ULTIMATE.start_strlen_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc24#1.base)_2 Supporting invariants [] [2021-12-15 17:01:10,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:10,373 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2021-12-15 17:01:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:10,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:01:10,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:10,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:01:10,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:10,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-15 17:01:10,482 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2021-12-15 17:01:10,513 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 49 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 7 states. [2021-12-15 17:01:10,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2021-12-15 17:01:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2021-12-15 17:01:10,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 3 letters. [2021-12-15 17:01:10,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:10,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-15 17:01:10,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:10,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-15 17:01:10,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:10,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2021-12-15 17:01:10,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-12-15 17:01:10,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 41 states and 52 transitions. [2021-12-15 17:01:10,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2021-12-15 17:01:10,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-12-15 17:01:10,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2021-12-15 17:01:10,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:10,515 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2021-12-15 17:01:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2021-12-15 17:01:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-12-15 17:01:10,517 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) [2021-12-15 17:01:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2021-12-15 17:01:10,517 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2021-12-15 17:01:10,517 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2021-12-15 17:01:10,517 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:01:10,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2021-12-15 17:01:10,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-12-15 17:01:10,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:10,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:10,518 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:10,518 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:10,518 INFO L791 eck$LassoCheckResult]: Stem: 828#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 809#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; 810#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; 794#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 795#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; 806#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; 798#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 799#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; 805#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 811#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 812#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 830#L510-5 strlen_#res#1 := strlen_~i~0#1; 803#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; 804#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 816#L510-10 [2021-12-15 17:01:10,518 INFO L793 eck$LassoCheckResult]: Loop: 816#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 817#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; 819#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; 816#L510-10 [2021-12-15 17:01:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1526227897, now seen corresponding path program 1 times [2021-12-15 17:01:10,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:10,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670043094] [2021-12-15 17:01:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:10,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:10,527 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:10,535 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 2 times [2021-12-15 17:01:10,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:10,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107181937] [2021-12-15 17:01:10,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:10,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:10,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:10,540 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1331413406, now seen corresponding path program 1 times [2021-12-15 17:01:10,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:10,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424416900] [2021-12-15 17:01:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:10,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:10,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:10,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424416900] [2021-12-15 17:01:10,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424416900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:01:10,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:01:10,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 17:01:10,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090892576] [2021-12-15 17:01:10,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:01:10,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 17:01:10,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-15 17:01:10,713 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) [2021-12-15 17:01:10,933 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 [2021-12-15 17:01:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:10,973 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2021-12-15 17:01:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 17:01:10,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 104 transitions. [2021-12-15 17:01:10,974 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2021-12-15 17:01:10,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 104 transitions. [2021-12-15 17:01:10,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2021-12-15 17:01:10,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2021-12-15 17:01:10,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 104 transitions. [2021-12-15 17:01:10,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:10,975 INFO L681 BuchiCegarLoop]: Abstraction has 82 states and 104 transitions. [2021-12-15 17:01:10,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 104 transitions. [2021-12-15 17:01:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2021-12-15 17:01:10,977 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) [2021-12-15 17:01:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2021-12-15 17:01:10,978 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2021-12-15 17:01:10,978 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 76 transitions. [2021-12-15 17:01:10,978 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:01:10,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 76 transitions. [2021-12-15 17:01:10,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2021-12-15 17:01:10,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:10,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:10,978 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:10,978 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:10,978 INFO L791 eck$LassoCheckResult]: Stem: 978#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 959#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; 960#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; 942#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; 944#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 945#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 946#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; 1000#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; 999#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 954#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; 955#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 961#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 962#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 981#L510-5 strlen_#res#1 := strlen_~i~0#1; 952#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; 953#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 966#L510-10 [2021-12-15 17:01:10,978 INFO L793 eck$LassoCheckResult]: Loop: 966#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 967#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; 980#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; 966#L510-10 [2021-12-15 17:01:10,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash -432721371, now seen corresponding path program 1 times [2021-12-15 17:01:10,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:10,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303383300] [2021-12-15 17:01:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:10,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:10,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:10,996 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash 100456, now seen corresponding path program 3 times [2021-12-15 17:01:10,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:10,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962183245] [2021-12-15 17:01:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:10,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:10,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:11,000 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:11,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2005437500, now seen corresponding path program 1 times [2021-12-15 17:01:11,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:11,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44413306] [2021-12-15 17:01:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:11,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:11,007 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:11,015 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:11,956 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:11,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:11,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:11,956 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:11,956 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:11,956 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:11,956 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:11,956 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:11,956 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2021-12-15 17:01:11,956 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:11,956 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:11,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:11,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:12,757 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:12,757 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:12,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:12,760 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) [2021-12-15 17:01:12,761 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 [2021-12-15 17:01:12,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:12,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:12,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:12,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:12,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:12,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:12,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:12,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:12,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:12,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:12,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:12,786 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) [2021-12-15 17:01:12,786 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 [2021-12-15 17:01:12,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:12,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:12,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:12,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:12,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:12,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:12,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:12,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:12,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:12,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:12,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:12,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:12,819 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) [2021-12-15 17:01:12,819 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 [2021-12-15 17:01:12,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:12,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:12,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:12,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:12,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:12,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:12,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:12,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:12,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:12,842 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 [2021-12-15 17:01:12,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:12,843 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) [2021-12-15 17:01:12,844 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 [2021-12-15 17:01:12,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:12,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:12,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:12,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:12,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:12,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:12,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:12,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:12,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:12,867 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 [2021-12-15 17:01:12,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:12,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:12,868 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) [2021-12-15 17:01:12,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:12,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:12,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:12,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:12,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:12,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:12,884 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:12,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:12,898 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 [2021-12-15 17:01:12,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:12,921 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 [2021-12-15 17:01:12,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:12,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:12,922 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) [2021-12-15 17:01:12,923 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 [2021-12-15 17:01:12,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:12,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:12,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:12,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:12,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:12,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:12,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:12,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:12,961 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 [2021-12-15 17:01:12,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:12,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:12,962 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) [2021-12-15 17:01:12,971 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 [2021-12-15 17:01:12,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:12,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:12,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:12,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:12,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:12,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:12,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:12,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:12,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,008 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 [2021-12-15 17:01:13,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,010 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) [2021-12-15 17:01:13,011 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 [2021-12-15 17:01:13,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,019 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-12-15 17:01:13,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,037 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) [2021-12-15 17:01:13,038 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 [2021-12-15 17:01:13,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:13,045 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:13,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:13,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,077 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) [2021-12-15 17:01:13,079 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 [2021-12-15 17:01:13,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,102 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 [2021-12-15 17:01:13,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,103 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) [2021-12-15 17:01:13,104 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 [2021-12-15 17:01:13,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:13,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,136 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) [2021-12-15 17:01:13,137 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 [2021-12-15 17:01:13,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:13,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,171 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) [2021-12-15 17:01:13,172 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 [2021-12-15 17:01:13,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,180 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,180 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:13,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,196 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) [2021-12-15 17:01:13,197 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 [2021-12-15 17:01:13,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,213 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-15 17:01:13,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,229 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) [2021-12-15 17:01:13,229 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 [2021-12-15 17:01:13,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,253 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 [2021-12-15 17:01:13,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,254 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:01:13,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-15 17:01:13,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:13,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,279 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) [2021-12-15 17:01:13,280 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 [2021-12-15 17:01:13,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:13,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:13,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,305 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 [2021-12-15 17:01:13,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,306 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) [2021-12-15 17:01:13,307 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 [2021-12-15 17:01:13,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,331 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 [2021-12-15 17:01:13,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,332 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) [2021-12-15 17:01:13,333 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 [2021-12-15 17:01:13,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:13,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:13,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,372 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 [2021-12-15 17:01:13,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,373 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) [2021-12-15 17:01:13,374 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 [2021-12-15 17:01:13,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,398 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 [2021-12-15 17:01:13,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,399 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) [2021-12-15 17:01:13,400 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 [2021-12-15 17:01:13,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,423 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 [2021-12-15 17:01:13,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,424 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) [2021-12-15 17:01:13,425 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 [2021-12-15 17:01:13,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,448 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 [2021-12-15 17:01:13,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,450 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) [2021-12-15 17:01:13,450 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 [2021-12-15 17:01:13,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-12-15 17:01:13,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,474 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) [2021-12-15 17:01:13,476 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 [2021-12-15 17:01:13,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,501 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 [2021-12-15 17:01:13,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,502 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) [2021-12-15 17:01:13,502 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 [2021-12-15 17:01:13,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,527 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 [2021-12-15 17:01:13,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,530 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) [2021-12-15 17:01:13,531 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 [2021-12-15 17:01:13,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 [2021-12-15 17:01:13,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-12-15 17:01:13,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,558 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) [2021-12-15 17:01:13,559 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 [2021-12-15 17:01:13,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 [2021-12-15 17:01:13,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,566 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:13,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,589 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) [2021-12-15 17:01:13,589 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 [2021-12-15 17:01:13,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,626 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 [2021-12-15 17:01:13,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,628 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) [2021-12-15 17:01:13,628 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 [2021-12-15 17:01:13,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:13,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,656 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) [2021-12-15 17:01:13,657 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 [2021-12-15 17:01:13,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:13,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:13,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:13,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:13,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:13,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,692 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) [2021-12-15 17:01:13,692 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 [2021-12-15 17:01:13,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:13,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:13,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:13,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:13,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:13,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:13,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:13,720 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:13,751 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2021-12-15 17:01:13,751 INFO L444 ModelExtractionUtils]: 31 out of 58 variables were initially zero. Simplification set additionally 24 variables to zero. [2021-12-15 17:01:13,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:13,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:13,752 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) [2021-12-15 17:01:13,754 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 [2021-12-15 17:01:13,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:13,761 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:01:13,761 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:13,761 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_4) = -1*ULTIMATE.start_strlen_~s#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc20#1.base)_4 Supporting invariants [] [2021-12-15 17:01:13,777 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 [2021-12-15 17:01:13,806 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2021-12-15 17:01:13,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:13,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:01:13,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:13,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:01:13,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:13,968 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 [2021-12-15 17:01:13,968 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) [2021-12-15 17:01:14,050 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. [2021-12-15 17:01:14,050 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 [2021-12-15 17:01:14,051 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) [2021-12-15 17:01:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2021-12-15 17:01:14,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 16 letters. Loop has 3 letters. [2021-12-15 17:01:14,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:14,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 19 letters. Loop has 3 letters. [2021-12-15 17:01:14,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:14,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 56 transitions. Stem has 16 letters. Loop has 6 letters. [2021-12-15 17:01:14,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:14,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 114 transitions. [2021-12-15 17:01:14,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-15 17:01:14,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 74 states and 94 transitions. [2021-12-15 17:01:14,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2021-12-15 17:01:14,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2021-12-15 17:01:14,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 94 transitions. [2021-12-15 17:01:14,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:14,053 INFO L681 BuchiCegarLoop]: Abstraction has 74 states and 94 transitions. [2021-12-15 17:01:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 94 transitions. [2021-12-15 17:01:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2021-12-15 17:01:14,055 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) [2021-12-15 17:01:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2021-12-15 17:01:14,055 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 78 transitions. [2021-12-15 17:01:14,055 INFO L587 BuchiCegarLoop]: Abstraction has 61 states and 78 transitions. [2021-12-15 17:01:14,055 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:01:14,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 78 transitions. [2021-12-15 17:01:14,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-15 17:01:14,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:14,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:14,056 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:14,056 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:01:14,056 INFO L791 eck$LassoCheckResult]: Stem: 1294#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1272#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; 1269#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; 1255#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1256#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; 1268#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; 1260#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1261#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; 1265#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1273#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1274#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1296#L510-5 strlen_#res#1 := strlen_~i~0#1; 1266#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; 1267#L509-2 assume strlen_~s#1.base == 0 && strlen_~s#1.offset == 0;strlen_#res#1 := 0; 1287#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; 1277#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1270#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); 1271#L532-3 [2021-12-15 17:01:14,056 INFO L793 eck$LassoCheckResult]: Loop: 1271#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; 1295#L533 assume !strstr_#t~short17#1; 1292#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; 1293#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; 1271#L532-3 [2021-12-15 17:01:14,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1331460076, now seen corresponding path program 1 times [2021-12-15 17:01:14,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:14,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781352121] [2021-12-15 17:01:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:14,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:14,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781352121] [2021-12-15 17:01:14,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781352121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:01:14,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:01:14,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:01:14,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624043824] [2021-12-15 17:01:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:01:14,089 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 1 times [2021-12-15 17:01:14,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:14,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218690306] [2021-12-15 17:01:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,098 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:14,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:14,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:14,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:01:14,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:01:14,241 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) [2021-12-15 17:01:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:14,264 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2021-12-15 17:01:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:01:14,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2021-12-15 17:01:14,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-15 17:01:14,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 76 transitions. [2021-12-15 17:01:14,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2021-12-15 17:01:14,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2021-12-15 17:01:14,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2021-12-15 17:01:14,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:14,266 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2021-12-15 17:01:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2021-12-15 17:01:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-12-15 17:01:14,267 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) [2021-12-15 17:01:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2021-12-15 17:01:14,268 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2021-12-15 17:01:14,268 INFO L587 BuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2021-12-15 17:01:14,268 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:01:14,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 76 transitions. [2021-12-15 17:01:14,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-15 17:01:14,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:14,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:14,268 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:14,268 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:01:14,268 INFO L791 eck$LassoCheckResult]: Stem: 1426#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1403#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; 1404#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; 1389#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1390#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; 1447#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; 1394#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1395#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; 1399#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1407#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1408#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1428#L510-5 strlen_#res#1 := strlen_~i~0#1; 1400#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; 1401#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1412#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1413#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1416#L510-11 strlen_#res#1 := strlen_~i~0#1; 1421#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; 1411#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1405#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); 1406#L532-3 [2021-12-15 17:01:14,269 INFO L793 eck$LassoCheckResult]: Loop: 1406#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; 1427#L533 assume !strstr_#t~short17#1; 1424#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; 1425#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; 1406#L532-3 [2021-12-15 17:01:14,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash -115443887, now seen corresponding path program 1 times [2021-12-15 17:01:14,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:14,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009384800] [2021-12-15 17:01:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:14,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009384800] [2021-12-15 17:01:14,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009384800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:01:14,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:01:14,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:01:14,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120095368] [2021-12-15 17:01:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:01:14,301 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 2 times [2021-12-15 17:01:14,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:14,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002070399] [2021-12-15 17:01:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,304 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,307 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:14,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:14,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:01:14,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:01:14,395 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) [2021-12-15 17:01:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:14,424 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2021-12-15 17:01:14,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 17:01:14,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 118 transitions. [2021-12-15 17:01:14,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-15 17:01:14,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 72 states and 86 transitions. [2021-12-15 17:01:14,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-12-15 17:01:14,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-12-15 17:01:14,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 86 transitions. [2021-12-15 17:01:14,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:14,426 INFO L681 BuchiCegarLoop]: Abstraction has 72 states and 86 transitions. [2021-12-15 17:01:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 86 transitions. [2021-12-15 17:01:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-12-15 17:01:14,428 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) [2021-12-15 17:01:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2021-12-15 17:01:14,428 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2021-12-15 17:01:14,428 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 66 transitions. [2021-12-15 17:01:14,428 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:01:14,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2021-12-15 17:01:14,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-15 17:01:14,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:14,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:14,429 INFO L842 BuchiCegarLoop]: 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] [2021-12-15 17:01:14,429 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:01:14,429 INFO L791 eck$LassoCheckResult]: Stem: 1605#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1580#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; 1581#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; 1564#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1565#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; 1618#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; 1617#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; 1573#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1571#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1572#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; 1574#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1614#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1613#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; 1595#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; 1596#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1607#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1608#L510-5 strlen_#res#1 := strlen_~i~0#1; 1575#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; 1576#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1587#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1588#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1591#L510-11 strlen_#res#1 := strlen_~i~0#1; 1600#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; 1586#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1578#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); 1579#L532-3 [2021-12-15 17:01:14,429 INFO L793 eck$LassoCheckResult]: Loop: 1579#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; 1606#L533 assume !strstr_#t~short17#1; 1603#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; 1604#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; 1579#L532-3 [2021-12-15 17:01:14,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:14,429 INFO L85 PathProgramCache]: Analyzing trace with hash 278203018, now seen corresponding path program 1 times [2021-12-15 17:01:14,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:14,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426490581] [2021-12-15 17:01:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:01:14,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:14,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426490581] [2021-12-15 17:01:14,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426490581] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:01:14,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489757375] [2021-12-15 17:01:14,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:01:14,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:14,576 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:01:14,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2021-12-15 17:01:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:14,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:01:14,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 17:01:14,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 17:01:14,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489757375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:01:14,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 17:01:14,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2021-12-15 17:01:14,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776823812] [2021-12-15 17:01:14,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:01:14,695 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 3 times [2021-12-15 17:01:14,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:14,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672998452] [2021-12-15 17:01:14,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,698 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,700 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:14,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:14,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 17:01:14,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-15 17:01:14,800 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) [2021-12-15 17:01:14,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:14,846 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2021-12-15 17:01:14,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:01:14,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 73 transitions. [2021-12-15 17:01:14,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-15 17:01:14,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 41 states and 48 transitions. [2021-12-15 17:01:14,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-15 17:01:14,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-12-15 17:01:14,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2021-12-15 17:01:14,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:14,847 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2021-12-15 17:01:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2021-12-15 17:01:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2021-12-15 17:01:14,848 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) [2021-12-15 17:01:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2021-12-15 17:01:14,848 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-15 17:01:14,849 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2021-12-15 17:01:14,849 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:01:14,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2021-12-15 17:01:14,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2021-12-15 17:01:14,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:14,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:14,849 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:14,849 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:01:14,849 INFO L791 eck$LassoCheckResult]: Stem: 1811#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1790#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; 1791#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; 1776#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; 1777#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1778#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 1779#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; 1787#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; 1780#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; 1781#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 1782#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 1783#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; 1786#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1792#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1793#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; 1805#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; 1794#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1795#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1813#L510-5 strlen_#res#1 := strlen_~i~0#1; 1784#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; 1785#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 1797#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1798#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; 1802#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; 1799#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 1800#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 1801#L510-11 strlen_#res#1 := strlen_~i~0#1; 1806#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; 1796#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 1788#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); 1789#L532-3 [2021-12-15 17:01:14,849 INFO L793 eck$LassoCheckResult]: Loop: 1789#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; 1812#L533 assume !strstr_#t~short17#1; 1809#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; 1810#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; 1789#L532-3 [2021-12-15 17:01:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1690519729, now seen corresponding path program 1 times [2021-12-15 17:01:14,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:14,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700880443] [2021-12-15 17:01:14,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,872 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash 4089565, now seen corresponding path program 4 times [2021-12-15 17:01:14,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:14,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698909240] [2021-12-15 17:01:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,876 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:14,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:14,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1271781261, now seen corresponding path program 1 times [2021-12-15 17:01:14,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:14,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100207723] [2021-12-15 17:01:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:14,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:14,897 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:16,853 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:16,853 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:16,853 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:16,853 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:16,853 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:16,853 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:16,853 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:16,853 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:16,853 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration11_Lasso [2021-12-15 17:01:16,853 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:16,853 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:16,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:16,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:16,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:17,999 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:17,999 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:17,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:17,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:18,000 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) [2021-12-15 17:01:18,001 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 [2021-12-15 17:01:18,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:18,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:18,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:18,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:18,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:18,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:18,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:18,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:18,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:18,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:18,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:18,086 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) [2021-12-15 17:01:18,087 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 [2021-12-15 17:01:18,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:18,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:18,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:18,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:18,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:18,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:18,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:18,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:18,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:18,110 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 [2021-12-15 17:01:18,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:18,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:18,111 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) [2021-12-15 17:01:18,112 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 [2021-12-15 17:01:18,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:18,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:18,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:18,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:18,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:18,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:18,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:18,149 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:18,222 INFO L443 ModelExtractionUtils]: Simplification made 39 calls to the SMT solver. [2021-12-15 17:01:18,222 INFO L444 ModelExtractionUtils]: 8 out of 58 variables were initially zero. Simplification set additionally 45 variables to zero. [2021-12-15 17:01:18,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:18,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:18,224 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) [2021-12-15 17:01:18,229 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:18,237 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 [2021-12-15 17:01:18,267 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:01:18,267 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:18,268 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack#1.offset, ULTIMATE.start_main_~in_len~0#1) = -1*ULTIMATE.start_strstr_~haystack#1.offset + 1*ULTIMATE.start_main_~in_len~0#1 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_strlen_~s#1.base)_3 + 1*ULTIMATE.start_main_~in_len~0#1 >= 0] [2021-12-15 17:01:18,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:18,423 INFO L297 tatePredicateManager]: 39 out of 41 supporting invariants were superfluous and have been removed [2021-12-15 17:01:18,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:18,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-15 17:01:18,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:18,514 INFO L388 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 [2021-12-15 17:01:18,519 INFO L388 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 [2021-12-15 17:01:18,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:01:18,561 INFO L388 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 [2021-12-15 17:01:18,566 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 17:01:18,567 INFO L388 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 [2021-12-15 17:01:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:18,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:01:18,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:18,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:18,794 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2021-12-15 17:01:18,794 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) [2021-12-15 17:01:18,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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 9 states. [2021-12-15 17:01:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:01:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) [2021-12-15 17:01:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2021-12-15 17:01:18,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 30 letters. Loop has 4 letters. [2021-12-15 17:01:18,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:18,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 34 letters. Loop has 4 letters. [2021-12-15 17:01:18,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:18,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 30 letters. Loop has 8 letters. [2021-12-15 17:01:18,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:18,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2021-12-15 17:01:18,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:18,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 46 states and 55 transitions. [2021-12-15 17:01:18,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-15 17:01:18,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-15 17:01:18,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 55 transitions. [2021-12-15 17:01:18,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:18,885 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-12-15 17:01:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 55 transitions. [2021-12-15 17:01:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2021-12-15 17:01:18,888 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) [2021-12-15 17:01:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2021-12-15 17:01:18,888 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2021-12-15 17:01:18,888 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2021-12-15 17:01:18,888 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-15 17:01:18,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2021-12-15 17:01:18,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:18,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:18,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:18,890 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:01:18,890 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:18,890 INFO L791 eck$LassoCheckResult]: Stem: 2207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2184#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; 2185#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; 2170#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; 2171#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2172#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2173#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; 2181#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; 2174#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; 2175#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2176#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2177#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; 2178#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2186#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2187#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; 2199#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; 2188#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2189#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2212#L510-5 strlen_#res#1 := strlen_~i~0#1; 2179#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; 2180#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2191#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2192#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; 2196#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; 2193#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2194#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2195#L510-11 strlen_#res#1 := strlen_~i~0#1; 2200#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; 2190#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2182#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); 2183#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; 2210#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; 2202#L518-3 [2021-12-15 17:01:18,890 INFO L793 eck$LassoCheckResult]: Loop: 2202#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2213#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; 2201#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; 2202#L518-3 [2021-12-15 17:01:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1091824948, now seen corresponding path program 1 times [2021-12-15 17:01:18,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:18,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741709045] [2021-12-15 17:01:18,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:18,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:18,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:18,929 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:18,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 1 times [2021-12-15 17:01:18,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:18,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938511012] [2021-12-15 17:01:18,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:18,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:18,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:18,938 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:18,938 INFO L85 PathProgramCache]: Analyzing trace with hash 769802655, now seen corresponding path program 1 times [2021-12-15 17:01:18,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:18,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455994062] [2021-12-15 17:01:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:18,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:18,956 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:18,970 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:21,369 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:21,369 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:21,369 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:21,369 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:21,369 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:21,369 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:21,369 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:21,369 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:21,369 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration12_Lasso [2021-12-15 17:01:21,369 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:21,369 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:21,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:21,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:21,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:21,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:21,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:21,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:21,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:21,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:21,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:21,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:22,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:23,037 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:23,037 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:23,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,038 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) [2021-12-15 17:01:23,039 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 [2021-12-15 17:01:23,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:23,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:23,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:23,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:23,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-12-15 17:01:23,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,068 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) [2021-12-15 17:01:23,068 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 [2021-12-15 17:01:23,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:23,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:23,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:23,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:23,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:23,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,094 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) [2021-12-15 17:01:23,095 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 [2021-12-15 17:01:23,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:23,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:23,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:23,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:23,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-12-15 17:01:23,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,141 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) [2021-12-15 17:01:23,142 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 [2021-12-15 17:01:23,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:23,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:23,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:23,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2021-12-15 17:01:23,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,195 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) [2021-12-15 17:01:23,195 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 [2021-12-15 17:01:23,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:23,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:23,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:23,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:23,225 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 [2021-12-15 17:01:23,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,226 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) [2021-12-15 17:01:23,227 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 [2021-12-15 17:01:23,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:23,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:23,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:23,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:23,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:23,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,267 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) [2021-12-15 17:01:23,268 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 [2021-12-15 17:01:23,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:23,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:23,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:23,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:23,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:23,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,293 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) [2021-12-15 17:01:23,293 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 [2021-12-15 17:01:23,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:23,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:23,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:23,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:23,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:23,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,318 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) [2021-12-15 17:01:23,319 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 [2021-12-15 17:01:23,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:23,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:23,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:23,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:23,341 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 [2021-12-15 17:01:23,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,342 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) [2021-12-15 17:01:23,343 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 [2021-12-15 17:01:23,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:23,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:23,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:23,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:23,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:23,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:23,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:23,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:23,421 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 17:01:23,421 INFO L444 ModelExtractionUtils]: 24 out of 79 variables were initially zero. Simplification set additionally 52 variables to zero. [2021-12-15 17:01:23,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:23,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:23,427 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) [2021-12-15 17:01:23,431 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:23,440 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 [2021-12-15 17:01:23,460 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:01:23,460 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:23,460 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~needle~0#1.base)_4, ULTIMATE.start_memcmp_~d~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~needle~0#1.base)_4 - 1*ULTIMATE.start_memcmp_~d~0#1.offset Supporting invariants [] [2021-12-15 17:01:23,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:23,646 INFO L297 tatePredicateManager]: 55 out of 58 supporting invariants were superfluous and have been removed [2021-12-15 17:01:23,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:23,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-15 17:01:23,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:23,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 17:01:23,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:23,924 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2021-12-15 17:01:23,924 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 15 Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:24,023 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 [2021-12-15 17:01:24,112 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 15. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 102 states and 123 transitions. Complement of second has 16 states. [2021-12-15 17:01:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 2 non-accepting loop states 2 accepting loop states [2021-12-15 17:01:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2021-12-15 17:01:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 32 letters. Loop has 3 letters. [2021-12-15 17:01:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 35 letters. Loop has 3 letters. [2021-12-15 17:01:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 32 letters. Loop has 6 letters. [2021-12-15 17:01:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:24,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 123 transitions. [2021-12-15 17:01:24,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:24,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 80 states and 97 transitions. [2021-12-15 17:01:24,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-15 17:01:24,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2021-12-15 17:01:24,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 97 transitions. [2021-12-15 17:01:24,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:24,115 INFO L681 BuchiCegarLoop]: Abstraction has 80 states and 97 transitions. [2021-12-15 17:01:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 97 transitions. [2021-12-15 17:01:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2021-12-15 17:01:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 50 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) [2021-12-15 17:01:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2021-12-15 17:01:24,119 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2021-12-15 17:01:24,119 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2021-12-15 17:01:24,119 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-15 17:01:24,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2021-12-15 17:01:24,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:24,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:24,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:24,120 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [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] [2021-12-15 17:01:24,120 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:24,120 INFO L791 eck$LassoCheckResult]: Stem: 2752#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2728#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; 2729#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; 2716#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; 2717#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2718#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 2719#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; 2727#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; 2720#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; 2721#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 2722#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 2723#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; 2724#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2732#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2733#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; 2745#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; 2734#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2735#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2758#L510-5 strlen_#res#1 := strlen_~i~0#1; 2725#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; 2726#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 2737#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2738#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; 2744#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; 2739#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 2740#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 2743#L510-11 strlen_#res#1 := strlen_~i~0#1; 2746#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; 2736#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 2730#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); 2731#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; 2765#L533 assume !strstr_#t~short17#1; 2750#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; 2751#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; 2753#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; 2755#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; 2748#L518-3 [2021-12-15 17:01:24,121 INFO L793 eck$LassoCheckResult]: Loop: 2748#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 2759#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; 2747#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; 2748#L518-3 [2021-12-15 17:01:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:24,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1883884272, now seen corresponding path program 1 times [2021-12-15 17:01:24,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:24,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094580628] [2021-12-15 17:01:24,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:24,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 17:01:24,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:24,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094580628] [2021-12-15 17:01:24,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094580628] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:01:24,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959181622] [2021-12-15 17:01:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:24,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:01:24,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:24,230 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:01:24,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2021-12-15 17:01:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:24,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-15 17:01:24,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:24,358 INFO L388 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 [2021-12-15 17:01:24,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:01:24,796 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:01:24,796 INFO L388 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 [2021-12-15 17:01:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 17:01:24,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:01:25,170 INFO L388 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 [2021-12-15 17:01:25,178 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-15 17:01:25,179 INFO L388 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 [2021-12-15 17:01:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 17:01:25,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959181622] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:01:25,188 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:01:25,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 33 [2021-12-15 17:01:25,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826138413] [2021-12-15 17:01:25,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:01:25,189 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:25,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 2 times [2021-12-15 17:01:25,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:25,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634594932] [2021-12-15 17:01:25,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:25,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:25,193 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:25,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:25,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:25,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-15 17:01:25,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2021-12-15 17:01:25,278 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 18 Second operand has 33 states, 33 states have (on average 2.8484848484848486) internal successors, (94), 33 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) [2021-12-15 17:01:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:27,165 INFO L93 Difference]: Finished difference Result 210 states and 253 transitions. [2021-12-15 17:01:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-12-15 17:01:27,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 253 transitions. [2021-12-15 17:01:27,186 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2021-12-15 17:01:27,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 189 states and 229 transitions. [2021-12-15 17:01:27,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-12-15 17:01:27,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-12-15 17:01:27,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 229 transitions. [2021-12-15 17:01:27,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:27,188 INFO L681 BuchiCegarLoop]: Abstraction has 189 states and 229 transitions. [2021-12-15 17:01:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 229 transitions. [2021-12-15 17:01:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 83. [2021-12-15 17:01:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 82 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2021-12-15 17:01:27,198 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 99 transitions. [2021-12-15 17:01:27,198 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 99 transitions. [2021-12-15 17:01:27,198 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-15 17:01:27,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 99 transitions. [2021-12-15 17:01:27,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:27,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:27,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:27,205 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 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] [2021-12-15 17:01:27,205 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:27,206 INFO L791 eck$LassoCheckResult]: Stem: 3360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3331#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; 3332#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; 3317#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; 3318#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3319#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 3320#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; 3328#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; 3321#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; 3322#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3323#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 3324#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; 3325#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3333#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3334#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; 3367#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; 3335#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3337#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3375#L510-5 strlen_#res#1 := strlen_~i~0#1; 3376#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; 3351#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3352#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3345#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; 3346#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; 3341#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3342#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; 3378#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; 3377#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3343#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3344#L510-11 strlen_#res#1 := strlen_~i~0#1; 3353#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; 3338#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 3329#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); 3330#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; 3371#L533 assume !strstr_#t~short17#1; 3358#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; 3359#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; 3379#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; 3363#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; 3355#L518-3 [2021-12-15 17:01:27,206 INFO L793 eck$LassoCheckResult]: Loop: 3355#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3368#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; 3354#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; 3355#L518-3 [2021-12-15 17:01:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:27,206 INFO L85 PathProgramCache]: Analyzing trace with hash 866645995, now seen corresponding path program 2 times [2021-12-15 17:01:27,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:27,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529469806] [2021-12-15 17:01:27,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:27,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 17:01:27,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:27,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529469806] [2021-12-15 17:01:27,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529469806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:01:27,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800276091] [2021-12-15 17:01:27,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:01:27,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:01:27,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:27,433 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:01:27,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2021-12-15 17:01:27,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:01:27,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:01:27,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-15 17:01:27,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:27,585 INFO L388 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 [2021-12-15 17:01:27,630 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 17:01:27,630 INFO L388 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 [2021-12-15 17:01:27,850 INFO L388 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 [2021-12-15 17:01:27,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 17:01:27,897 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:01:27,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2021-12-15 17:01:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 17:01:27,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:01:27,911 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-15 17:01:27,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 17:01:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 17:01:28,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800276091] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:01:28,265 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:01:28,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2021-12-15 17:01:28,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728703098] [2021-12-15 17:01:28,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:01:28,266 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:28,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 3 times [2021-12-15 17:01:28,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:28,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40991469] [2021-12-15 17:01:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:28,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:28,279 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:28,289 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:28,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-15 17:01:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2021-12-15 17:01:28,371 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. cyclomatic complexity: 24 Second operand has 30 states, 30 states have (on average 3.0) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:28,741 INFO L93 Difference]: Finished difference Result 169 states and 201 transitions. [2021-12-15 17:01:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 17:01:28,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 201 transitions. [2021-12-15 17:01:28,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:01:28,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 201 transitions. [2021-12-15 17:01:28,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2021-12-15 17:01:28,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2021-12-15 17:01:28,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 201 transitions. [2021-12-15 17:01:28,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:28,743 INFO L681 BuchiCegarLoop]: Abstraction has 169 states and 201 transitions. [2021-12-15 17:01:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 201 transitions. [2021-12-15 17:01:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 125. [2021-12-15 17:01:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.176) internal successors, (147), 124 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2021-12-15 17:01:28,746 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 147 transitions. [2021-12-15 17:01:28,746 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 147 transitions. [2021-12-15 17:01:28,746 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-15 17:01:28,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 147 transitions. [2021-12-15 17:01:28,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:28,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:28,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:28,748 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 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] [2021-12-15 17:01:28,748 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:28,749 INFO L791 eck$LassoCheckResult]: Stem: 3893#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3864#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; 3865#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; 3850#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; 3851#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3852#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; 3854#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3974#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 3973#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; 3972#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; 3971#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; 3859#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 3857#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 3858#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; 3860#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3868#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3869#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; 3966#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; 3965#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3950#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3949#L510-5 strlen_#res#1 := strlen_~i~0#1; 3947#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; 3948#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 3943#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3944#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; 3940#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; 3939#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3937#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; 3938#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; 3936#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 3926#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 3927#L510-11 strlen_#res#1 := strlen_~i~0#1; 3908#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; 3909#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 3866#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); 3867#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; 3935#L533 assume !strstr_#t~short17#1; 3891#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; 3892#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; 3910#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; 3896#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; 3888#L518-3 [2021-12-15 17:01:28,749 INFO L793 eck$LassoCheckResult]: Loop: 3888#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 3902#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; 3887#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; 3888#L518-3 [2021-12-15 17:01:28,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:28,749 INFO L85 PathProgramCache]: Analyzing trace with hash -957212723, now seen corresponding path program 3 times [2021-12-15 17:01:28,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:28,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613097480] [2021-12-15 17:01:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:28,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:28,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:28,843 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:28,859 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 4 times [2021-12-15 17:01:28,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:28,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775179981] [2021-12-15 17:01:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:28,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:28,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:28,868 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2036243354, now seen corresponding path program 1 times [2021-12-15 17:01:28,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:28,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330918755] [2021-12-15 17:01:28,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:28,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:28,909 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:28,963 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:32,344 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:01:32,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:01:32,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:01:32,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:01:32,345 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:01:32,345 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:32,345 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:01:32,345 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:01:32,345 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration15_Lasso [2021-12-15 17:01:32,345 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:01:32,346 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:01:32,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:32,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:33,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:01:34,579 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:01:34,580 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:01:34,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,581 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) [2021-12-15 17:01:34,582 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 [2021-12-15 17:01:34,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:34,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,633 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) [2021-12-15 17:01:34,633 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 [2021-12-15 17:01:34,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:34,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,673 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) [2021-12-15 17:01:34,673 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 [2021-12-15 17:01:34,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:34,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,714 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) [2021-12-15 17:01:34,715 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 [2021-12-15 17:01:34,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:34,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,741 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) [2021-12-15 17:01:34,742 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 [2021-12-15 17:01:34,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,779 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 [2021-12-15 17:01:34,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,781 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) [2021-12-15 17:01:34,787 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 [2021-12-15 17:01:34,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,812 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 [2021-12-15 17:01:34,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,813 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) [2021-12-15 17:01:34,814 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 [2021-12-15 17:01:34,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,852 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 [2021-12-15 17:01:34,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,853 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) [2021-12-15 17:01:34,854 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 [2021-12-15 17:01:34,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:34,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,889 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) [2021-12-15 17:01:34,890 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 [2021-12-15 17:01:34,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:34,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:34,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:34,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,931 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) [2021-12-15 17:01:34,931 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 [2021-12-15 17:01:34,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 [2021-12-15 17:01:34,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:34,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:34,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:34,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:34,963 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) [2021-12-15 17:01:34,964 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 [2021-12-15 17:01:34,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:34,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:34,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:34,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:34,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:34,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:34,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:34,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:34,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:35,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,004 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) [2021-12-15 17:01:35,004 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 [2021-12-15 17:01:35,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 [2021-12-15 17:01:35,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:35,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:35,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:35,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:35,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,040 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) [2021-12-15 17:01:35,041 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 [2021-12-15 17:01:35,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:35,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:35,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:35,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:35,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,080 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) [2021-12-15 17:01:35,081 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 [2021-12-15 17:01:35,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 [2021-12-15 17:01:35,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:35,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:35,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:35,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,111 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 [2021-12-15 17:01:35,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,113 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) [2021-12-15 17:01:35,116 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 [2021-12-15 17:01:35,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:35,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:35,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,182 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 [2021-12-15 17:01:35,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,184 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) [2021-12-15 17:01:35,187 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 [2021-12-15 17:01:35,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:35,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:35,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:35,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,225 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 [2021-12-15 17:01:35,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,227 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) [2021-12-15 17:01:35,228 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 [2021-12-15 17:01:35,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:35,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:35,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:35,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,262 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 [2021-12-15 17:01:35,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,272 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) [2021-12-15 17:01:35,273 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 [2021-12-15 17:01:35,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:35,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:35,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:35,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:35,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,313 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) [2021-12-15 17:01:35,314 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 [2021-12-15 17:01:35,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 [2021-12-15 17:01:35,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:35,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:35,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:35,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,346 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 [2021-12-15 17:01:35,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,357 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) [2021-12-15 17:01:35,358 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 [2021-12-15 17:01:35,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:35,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:35,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:35,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,385 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) [2021-12-15 17:01:35,386 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 [2021-12-15 17:01:35,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:35,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:35,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:35,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:35,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,425 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) [2021-12-15 17:01:35,426 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 [2021-12-15 17:01:35,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:01:35,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:01:35,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:01:35,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,462 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 [2021-12-15 17:01:35,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,463 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) [2021-12-15 17:01:35,464 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 [2021-12-15 17:01:35,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:35,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:35,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:35,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,552 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) [2021-12-15 17:01:35,552 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 [2021-12-15 17:01:35,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 [2021-12-15 17:01:35,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:35,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:35,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:35,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,631 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) [2021-12-15 17:01:35,632 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 [2021-12-15 17:01:35,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:35,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:35,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,670 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 [2021-12-15 17:01:35,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,672 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) [2021-12-15 17:01:35,672 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 [2021-12-15 17:01:35,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:35,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:35,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,747 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 [2021-12-15 17:01:35,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,756 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) [2021-12-15 17:01:35,787 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 [2021-12-15 17:01:35,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:35,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:35,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:01:35,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2021-12-15 17:01:35,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:35,821 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) [2021-12-15 17:01:35,822 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 [2021-12-15 17:01:35,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:01:35,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:01:35,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:01:35,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:01:35,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:01:35,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:01:35,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:01:35,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:01:36,026 INFO L443 ModelExtractionUtils]: Simplification made 77 calls to the SMT solver. [2021-12-15 17:01:36,026 INFO L444 ModelExtractionUtils]: 14 out of 85 variables were initially zero. Simplification set additionally 68 variables to zero. [2021-12-15 17:01:36,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:01:36,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:36,027 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) [2021-12-15 17:01:36,028 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 [2021-12-15 17:01:36,029 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:01:36,050 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:01:36,050 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:01:36,050 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~d~0#1.offset, v_rep(select #length ULTIMATE.start_strlen_#in~s#1.base)_1) = -1*ULTIMATE.start_memcmp_~d~0#1.offset + 1*v_rep(select #length ULTIMATE.start_strlen_#in~s#1.base)_1 Supporting invariants [] [2021-12-15 17:01:36,069 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 [2021-12-15 17:01:36,373 INFO L297 tatePredicateManager]: 83 out of 84 supporting invariants were superfluous and have been removed [2021-12-15 17:01:36,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:36,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 17:01:36,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:36,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:01:36,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:01:36,503 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-15 17:01:36,503 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 147 transitions. cyclomatic complexity: 33 Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:36,525 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 147 transitions. cyclomatic complexity: 33. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 200 states and 237 transitions. Complement of second has 8 states. [2021-12-15 17:01:36,526 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 [2021-12-15 17:01:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2021-12-15 17:01:36,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 41 letters. Loop has 3 letters. [2021-12-15 17:01:36,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:36,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 44 letters. Loop has 3 letters. [2021-12-15 17:01:36,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:36,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 41 letters. Loop has 6 letters. [2021-12-15 17:01:36,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:01:36,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 237 transitions. [2021-12-15 17:01:36,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:36,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 158 states and 187 transitions. [2021-12-15 17:01:36,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2021-12-15 17:01:36,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2021-12-15 17:01:36,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 187 transitions. [2021-12-15 17:01:36,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:36,529 INFO L681 BuchiCegarLoop]: Abstraction has 158 states and 187 transitions. [2021-12-15 17:01:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 187 transitions. [2021-12-15 17:01:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2021-12-15 17:01:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.1666666666666667) internal successors, (154), 131 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2021-12-15 17:01:36,535 INFO L704 BuchiCegarLoop]: Abstraction has 132 states and 154 transitions. [2021-12-15 17:01:36,535 INFO L587 BuchiCegarLoop]: Abstraction has 132 states and 154 transitions. [2021-12-15 17:01:36,535 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-15 17:01:36,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 154 transitions. [2021-12-15 17:01:36,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:36,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:36,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:36,537 INFO L842 BuchiCegarLoop]: 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] [2021-12-15 17:01:36,538 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:36,538 INFO L791 eck$LassoCheckResult]: Stem: 4718#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4688#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; 4689#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; 4675#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; 4676#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4677#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 4678#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; 4687#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; 4680#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; 4681#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 4682#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 4683#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; 4684#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4710#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4797#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; 4795#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; 4792#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4793#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4798#L510-5 strlen_#res#1 := strlen_~i~0#1; 4796#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; 4794#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 4791#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4706#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; 4707#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; 4700#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4701#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; 4723#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; 4724#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4704#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4705#L510-11 strlen_#res#1 := strlen_~i~0#1; 4711#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; 4697#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4690#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); 4691#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; 4729#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; 4715#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4733#L518-1 assume !(0 != memcmp_#t~pre6#1 % 18446744073709551616);havoc memcmp_#t~pre6#1; 4734#L518-4 memcmp_#res#1 := 0; 4740#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 4738#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; 4737#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; 4736#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; 4720#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; 4713#L518-3 [2021-12-15 17:01:36,544 INFO L793 eck$LassoCheckResult]: Loop: 4713#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 4726#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; 4712#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; 4713#L518-3 [2021-12-15 17:01:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash -885642791, now seen corresponding path program 1 times [2021-12-15 17:01:36,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:36,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696579169] [2021-12-15 17:01:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:36,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 17:01:36,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:36,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696579169] [2021-12-15 17:01:36,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696579169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:01:36,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:01:36,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:01:36,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314714551] [2021-12-15 17:01:36,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:01:36,595 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:36,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 5 times [2021-12-15 17:01:36,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:36,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556710702] [2021-12-15 17:01:36,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:36,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:36,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:36,602 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:36,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:36,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:01:36,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:01:36,663 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. cyclomatic complexity: 34 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) [2021-12-15 17:01:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:36,670 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2021-12-15 17:01:36,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:01:36,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 156 transitions. [2021-12-15 17:01:36,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:36,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 130 states and 149 transitions. [2021-12-15 17:01:36,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-12-15 17:01:36,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2021-12-15 17:01:36,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 149 transitions. [2021-12-15 17:01:36,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:36,672 INFO L681 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2021-12-15 17:01:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 149 transitions. [2021-12-15 17:01:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-15 17:01:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.146153846153846) internal successors, (149), 129 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2021-12-15 17:01:36,674 INFO L704 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2021-12-15 17:01:36,674 INFO L587 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2021-12-15 17:01:36,674 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-15 17:01:36,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2021-12-15 17:01:36,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:36,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:36,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:36,674 INFO L842 BuchiCegarLoop]: 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] [2021-12-15 17:01:36,674 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:36,675 INFO L791 eck$LassoCheckResult]: Stem: 4992#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4967#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; 4968#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; 4952#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; 4953#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5076#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 5075#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; 5074#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; 5073#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; 5072#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 5071#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 5070#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; 5069#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5068#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5067#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; 5065#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; 5062#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5060#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5058#L510-5 strlen_#res#1 := strlen_~i~0#1; 5056#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; 5054#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5052#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5050#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; 5049#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; 4978#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4979#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; 4982#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; 4998#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 4980#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 4981#L510-11 strlen_#res#1 := strlen_~i~0#1; 5008#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; 5009#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 4965#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); 4966#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; 5027#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; 5022#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5024#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; 5016#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 5015#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 5013#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; 5011#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; 5010#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; 4994#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; 4987#L518-3 [2021-12-15 17:01:36,675 INFO L793 eck$LassoCheckResult]: Loop: 4987#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5000#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; 4986#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; 4987#L518-3 [2021-12-15 17:01:36,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash 717589665, now seen corresponding path program 1 times [2021-12-15 17:01:36,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:36,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125879873] [2021-12-15 17:01:36,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:36,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 17:01:36,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:36,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125879873] [2021-12-15 17:01:36,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125879873] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:01:36,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985060020] [2021-12-15 17:01:36,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:36,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:01:36,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:36,821 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:01:36,829 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 [2021-12-15 17:01:36,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2021-12-15 17:01:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:36,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-15 17:01:36,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:36,935 INFO L388 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 [2021-12-15 17:01:36,999 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 17:01:36,999 INFO L388 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 [2021-12-15 17:01:37,055 INFO L388 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 [2021-12-15 17:01:37,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 17:01:37,540 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:01:37,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-15 17:01:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 17:01:37,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:01:37,983 INFO L388 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 26 treesize of output 20 [2021-12-15 17:01:38,015 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:01:38,016 INFO L388 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 20 treesize of output 24 [2021-12-15 17:01:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 17:01:38,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985060020] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:01:38,472 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:01:38,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 17] total 38 [2021-12-15 17:01:38,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859381098] [2021-12-15 17:01:38,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:01:38,473 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:38,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:38,473 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 6 times [2021-12-15 17:01:38,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:38,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095399382] [2021-12-15 17:01:38,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:38,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:38,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-15 17:01:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2021-12-15 17:01:38,564 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 31 Second operand has 38 states, 38 states have (on average 2.3684210526315788) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:01:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:38,870 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2021-12-15 17:01:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-15 17:01:38,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 194 transitions. [2021-12-15 17:01:38,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:01:38,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 157 states and 180 transitions. [2021-12-15 17:01:38,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-12-15 17:01:38,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2021-12-15 17:01:38,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 180 transitions. [2021-12-15 17:01:38,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:38,872 INFO L681 BuchiCegarLoop]: Abstraction has 157 states and 180 transitions. [2021-12-15 17:01:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 180 transitions. [2021-12-15 17:01:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 112. [2021-12-15 17:01:38,873 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) [2021-12-15 17:01:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2021-12-15 17:01:38,874 INFO L704 BuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2021-12-15 17:01:38,874 INFO L587 BuchiCegarLoop]: Abstraction has 112 states and 128 transitions. [2021-12-15 17:01:38,874 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-15 17:01:38,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 128 transitions. [2021-12-15 17:01:38,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:38,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:38,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:38,874 INFO L842 BuchiCegarLoop]: 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] [2021-12-15 17:01:38,875 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:38,875 INFO L791 eck$LassoCheckResult]: Stem: 5612#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5584#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; 5585#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; 5570#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; 5571#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5572#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; 5574#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5651#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 5650#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; 5649#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; 5648#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; 5579#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 5577#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 5578#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; 5580#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5588#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5589#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; 5601#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; 5602#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5622#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5623#L510-5 strlen_#res#1 := strlen_~i~0#1; 5581#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; 5582#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5674#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5673#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; 5672#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; 5596#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5597#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; 5671#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; 5670#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5669#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5604#L510-11 strlen_#res#1 := strlen_~i~0#1; 5605#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; 5593#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 5586#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); 5587#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; 5628#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; 5609#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5676#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; 5657#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 5656#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 5655#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; 5653#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; 5652#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; 5614#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; 5607#L518-3 [2021-12-15 17:01:38,875 INFO L793 eck$LassoCheckResult]: Loop: 5607#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5625#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; 5606#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; 5607#L518-3 [2021-12-15 17:01:38,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash -900142205, now seen corresponding path program 2 times [2021-12-15 17:01:38,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:38,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127760025] [2021-12-15 17:01:38,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:38,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 17:01:38,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:38,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127760025] [2021-12-15 17:01:38,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127760025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:01:38,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:01:38,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:01:38,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071734139] [2021-12-15 17:01:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:01:38,935 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:38,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 7 times [2021-12-15 17:01:38,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:38,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464510727] [2021-12-15 17:01:38,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:38,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:38,941 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:39,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:39,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:01:39,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:01:39,028 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) [2021-12-15 17:01:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:39,066 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2021-12-15 17:01:39,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:01:39,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 145 transitions. [2021-12-15 17:01:39,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:39,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 125 states and 141 transitions. [2021-12-15 17:01:39,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2021-12-15 17:01:39,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2021-12-15 17:01:39,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 141 transitions. [2021-12-15 17:01:39,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:39,068 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 141 transitions. [2021-12-15 17:01:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 141 transitions. [2021-12-15 17:01:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2021-12-15 17:01:39,069 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) [2021-12-15 17:01:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2021-12-15 17:01:39,069 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 133 transitions. [2021-12-15 17:01:39,069 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 133 transitions. [2021-12-15 17:01:39,069 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-15 17:01:39,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 133 transitions. [2021-12-15 17:01:39,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:39,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:39,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:39,070 INFO L842 BuchiCegarLoop]: 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] [2021-12-15 17:01:39,070 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:39,070 INFO L791 eck$LassoCheckResult]: Stem: 5865#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5837#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; 5838#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; 5823#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; 5824#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5903#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; 5827#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5825#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 5826#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; 5881#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; 5882#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; 5902#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 5901#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 5900#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; 5857#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5841#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5842#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; 5855#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; 5856#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5912#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5911#L510-5 strlen_#res#1 := strlen_~i~0#1; 5910#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; 5909#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 5908#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5853#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; 5854#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; 5849#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5850#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; 5930#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; 5929#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 5928#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 5927#L510-11 strlen_#res#1 := strlen_~i~0#1; 5926#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; 5925#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 5924#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); 5878#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; 5879#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; 5876#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5877#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; 5880#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; 5933#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5934#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; 5904#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 5905#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 5891#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; 5888#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; 5886#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; 5867#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; 5860#L518-3 [2021-12-15 17:01:39,070 INFO L793 eck$LassoCheckResult]: Loop: 5860#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 5875#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; 5859#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; 5860#L518-3 [2021-12-15 17:01:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1802803372, now seen corresponding path program 1 times [2021-12-15 17:01:39,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:39,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236872536] [2021-12-15 17:01:39,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:39,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 17:01:39,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:39,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236872536] [2021-12-15 17:01:39,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236872536] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:01:39,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306642624] [2021-12-15 17:01:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:39,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:01:39,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:39,157 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) [2021-12-15 17:01:39,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2021-12-15 17:01:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:39,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-15 17:01:39,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 17:01:39,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:01:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 17:01:39,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306642624] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:01:39,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:01:39,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2021-12-15 17:01:39,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410079972] [2021-12-15 17:01:39,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:01:39,522 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:39,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 8 times [2021-12-15 17:01:39,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:39,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437131102] [2021-12-15 17:01:39,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:39,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:39,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:39,528 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:39,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:39,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 17:01:39,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-12-15 17:01:39,641 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) [2021-12-15 17:01:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:39,861 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2021-12-15 17:01:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 17:01:39,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 188 transitions. [2021-12-15 17:01:39,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:01:39,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 138 states and 158 transitions. [2021-12-15 17:01:39,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2021-12-15 17:01:39,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2021-12-15 17:01:39,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 158 transitions. [2021-12-15 17:01:39,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:39,863 INFO L681 BuchiCegarLoop]: Abstraction has 138 states and 158 transitions. [2021-12-15 17:01:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 158 transitions. [2021-12-15 17:01:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2021-12-15 17:01:39,864 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) [2021-12-15 17:01:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2021-12-15 17:01:39,865 INFO L704 BuchiCegarLoop]: Abstraction has 109 states and 124 transitions. [2021-12-15 17:01:39,865 INFO L587 BuchiCegarLoop]: Abstraction has 109 states and 124 transitions. [2021-12-15 17:01:39,865 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-15 17:01:39,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 124 transitions. [2021-12-15 17:01:39,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:39,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:39,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:39,865 INFO L842 BuchiCegarLoop]: 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] [2021-12-15 17:01:39,865 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:39,865 INFO L791 eck$LassoCheckResult]: Stem: 6463#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6435#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; 6436#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; 6420#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; 6421#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6422#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 6423#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; 6499#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; 6426#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; 6427#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 6428#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 6429#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; 6430#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6439#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6440#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; 6453#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; 6441#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6442#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; 6501#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; 6500#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6473#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6474#L510-5 strlen_#res#1 := strlen_~i~0#1; 6431#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; 6432#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 6484#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6483#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; 6469#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; 6470#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 6450#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 6451#L510-11 strlen_#res#1 := strlen_~i~0#1; 6480#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; 6481#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 6437#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); 6438#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; 6514#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; 6513#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6511#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; 6512#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; 6510#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6509#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; 6508#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 6467#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 6468#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; 6518#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; 6519#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; 6506#L533 assume !strstr_#t~short17#1; 6505#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; 6503#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; 6502#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; 6465#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; 6458#L518-3 [2021-12-15 17:01:39,866 INFO L793 eck$LassoCheckResult]: Loop: 6458#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 6475#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; 6457#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; 6458#L518-3 [2021-12-15 17:01:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1191678414, now seen corresponding path program 1 times [2021-12-15 17:01:39,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:39,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183135745] [2021-12-15 17:01:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:39,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 17:01:39,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:39,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183135745] [2021-12-15 17:01:39,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183135745] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:01:39,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040843034] [2021-12-15 17:01:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:39,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:01:39,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:39,981 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) [2021-12-15 17:01:39,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2021-12-15 17:01:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:40,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 17:01:40,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:40,106 INFO L388 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 [2021-12-15 17:01:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 17:01:40,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:01:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 17:01:40,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040843034] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:01:40,440 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:01:40,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2021-12-15 17:01:40,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615486398] [2021-12-15 17:01:40,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:01:40,440 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:40,440 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 9 times [2021-12-15 17:01:40,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:40,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147329742] [2021-12-15 17:01:40,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:40,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:40,445 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:40,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 17:01:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-15 17:01:40,573 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) [2021-12-15 17:01:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:40,714 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2021-12-15 17:01:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 17:01:40,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 148 transitions. [2021-12-15 17:01:40,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:40,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 115 states and 130 transitions. [2021-12-15 17:01:40,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2021-12-15 17:01:40,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2021-12-15 17:01:40,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 130 transitions. [2021-12-15 17:01:40,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:40,716 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 130 transitions. [2021-12-15 17:01:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 130 transitions. [2021-12-15 17:01:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2021-12-15 17:01:40,717 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) [2021-12-15 17:01:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2021-12-15 17:01:40,717 INFO L704 BuchiCegarLoop]: Abstraction has 113 states and 128 transitions. [2021-12-15 17:01:40,717 INFO L587 BuchiCegarLoop]: Abstraction has 113 states and 128 transitions. [2021-12-15 17:01:40,717 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-15 17:01:40,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 128 transitions. [2021-12-15 17:01:40,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:40,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:40,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:40,718 INFO L842 BuchiCegarLoop]: 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] [2021-12-15 17:01:40,718 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:40,718 INFO L791 eck$LassoCheckResult]: Stem: 7023#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7001#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; 7002#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; 6985#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; 6986#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6987#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 6988#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; 6998#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; 7040#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; 7066#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7065#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; 7064#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7063#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 7062#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; 7061#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7060#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7059#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; 7058#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; 7057#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7051#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; 7053#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; 7050#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7047#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7045#L510-5 strlen_#res#1 := strlen_~i~0#1; 7044#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; 7043#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7042#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7041#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; 7031#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; 7032#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7012#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7013#L510-11 strlen_#res#1 := strlen_~i~0#1; 7016#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; 7007#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 6999#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); 7000#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; 7085#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; 7084#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7082#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; 7083#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; 7081#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7080#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; 7079#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7028#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 7029#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; 7075#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; 7072#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; 7054#L533 assume !strstr_#t~short17#1; 7052#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; 7048#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; 7046#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; 7025#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; 7018#L518-3 [2021-12-15 17:01:40,718 INFO L793 eck$LassoCheckResult]: Loop: 7018#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7035#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; 7017#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; 7018#L518-3 [2021-12-15 17:01:40,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:40,718 INFO L85 PathProgramCache]: Analyzing trace with hash 283927796, now seen corresponding path program 2 times [2021-12-15 17:01:40,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:40,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743927302] [2021-12-15 17:01:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:40,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 17:01:40,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:40,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743927302] [2021-12-15 17:01:40,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743927302] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:01:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074631731] [2021-12-15 17:01:40,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:01:40,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:01:40,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:40,896 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) [2021-12-15 17:01:40,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2021-12-15 17:01:40,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:01:40,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:01:40,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-15 17:01:40,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:41,005 INFO L388 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 [2021-12-15 17:01:41,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 17:01:41,069 INFO L388 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 [2021-12-15 17:01:41,073 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 17:01:41,073 INFO L388 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 [2021-12-15 17:01:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 17:01:41,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:01:41,321 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 17:01:41,321 INFO L388 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 [2021-12-15 17:01:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 17:01:41,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074631731] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:01:41,377 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:01:41,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2021-12-15 17:01:41,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032691023] [2021-12-15 17:01:41,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:01:41,377 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 10 times [2021-12-15 17:01:41,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:41,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381834269] [2021-12-15 17:01:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:41,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:41,381 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:41,383 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:41,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:41,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-15 17:01:41,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2021-12-15 17:01:41,446 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) [2021-12-15 17:01:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:42,120 INFO L93 Difference]: Finished difference Result 310 states and 349 transitions. [2021-12-15 17:01:42,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-15 17:01:42,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 349 transitions. [2021-12-15 17:01:42,129 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2021-12-15 17:01:42,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 235 states and 271 transitions. [2021-12-15 17:01:42,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2021-12-15 17:01:42,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2021-12-15 17:01:42,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 271 transitions. [2021-12-15 17:01:42,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:42,130 INFO L681 BuchiCegarLoop]: Abstraction has 235 states and 271 transitions. [2021-12-15 17:01:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 271 transitions. [2021-12-15 17:01:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 100. [2021-12-15 17:01:42,132 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) [2021-12-15 17:01:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2021-12-15 17:01:42,132 INFO L704 BuchiCegarLoop]: Abstraction has 100 states and 113 transitions. [2021-12-15 17:01:42,132 INFO L587 BuchiCegarLoop]: Abstraction has 100 states and 113 transitions. [2021-12-15 17:01:42,132 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-15 17:01:42,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 113 transitions. [2021-12-15 17:01:42,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:42,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:42,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:42,133 INFO L842 BuchiCegarLoop]: 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] [2021-12-15 17:01:42,133 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:42,133 INFO L791 eck$LassoCheckResult]: Stem: 7841#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7815#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; 7816#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; 7800#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; 7801#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7802#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; 7803#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 7804#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 7813#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; 7814#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; 7805#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; 7806#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7807#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; 7808#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 7859#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 7809#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; 7810#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7819#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7820#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; 7831#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; 7821#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7822#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; 7850#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; 7860#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7861#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7857#L510-5 strlen_#res#1 := strlen_~i~0#1; 7858#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; 7832#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 7833#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7869#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; 7847#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; 7826#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7827#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; 7830#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; 7866#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 7828#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 7829#L510-11 strlen_#res#1 := strlen_~i~0#1; 7834#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; 7823#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 7817#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); 7818#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; 7854#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; 7852#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7853#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; 7837#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; 7838#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7894#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; 7888#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 7871#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 7868#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; 7867#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; 7865#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; 7843#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; 7836#L518-3 [2021-12-15 17:01:42,133 INFO L793 eck$LassoCheckResult]: Loop: 7836#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 7851#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; 7835#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; 7836#L518-3 [2021-12-15 17:01:42,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:42,133 INFO L85 PathProgramCache]: Analyzing trace with hash -131927407, now seen corresponding path program 2 times [2021-12-15 17:01:42,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:42,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911563916] [2021-12-15 17:01:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:42,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 17:01:42,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:42,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911563916] [2021-12-15 17:01:42,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911563916] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:01:42,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65726675] [2021-12-15 17:01:42,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:01:42,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:01:42,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:42,298 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) [2021-12-15 17:01:42,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2021-12-15 17:01:42,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:01:42,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:01:42,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-15 17:01:42,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 17:01:42,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:01:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 17:01:42,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65726675] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:01:42,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:01:42,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2021-12-15 17:01:42,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854736228] [2021-12-15 17:01:42,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:01:42,915 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:01:42,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:42,915 INFO L85 PathProgramCache]: Analyzing trace with hash 139186, now seen corresponding path program 11 times [2021-12-15 17:01:42,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:42,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072642982] [2021-12-15 17:01:42,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:42,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:42,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:01:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:01:42,921 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:01:43,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:01:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-15 17:01:43,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2021-12-15 17:01:43,046 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) [2021-12-15 17:01:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:01:43,310 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2021-12-15 17:01:43,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 17:01:43,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 254 transitions. [2021-12-15 17:01:43,312 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2021-12-15 17:01:43,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 202 states and 232 transitions. [2021-12-15 17:01:43,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2021-12-15 17:01:43,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2021-12-15 17:01:43,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 232 transitions. [2021-12-15 17:01:43,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 17:01:43,313 INFO L681 BuchiCegarLoop]: Abstraction has 202 states and 232 transitions. [2021-12-15 17:01:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 232 transitions. [2021-12-15 17:01:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 103. [2021-12-15 17:01:43,314 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) [2021-12-15 17:01:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-12-15 17:01:43,314 INFO L704 BuchiCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-12-15 17:01:43,314 INFO L587 BuchiCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-12-15 17:01:43,314 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-15 17:01:43,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 116 transitions. [2021-12-15 17:01:43,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 17:01:43,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:01:43,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:01:43,315 INFO L842 BuchiCegarLoop]: 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] [2021-12-15 17:01:43,315 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 17:01:43,315 INFO L791 eck$LassoCheckResult]: Stem: 8520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8494#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; 8495#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; 8479#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; 8480#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8481#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; 8482#L544-2 main_#t~post21#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8483#L544-3 assume !(main_~i~2#1 < main_~in_len~0#1 - 1); 8492#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; 8493#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; 8484#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; 8485#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 8486#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; 8487#L552-2 main_#t~post25#1 := main_~i~3#1;main_~i~3#1 := 1 + main_#t~post25#1;havoc main_#t~post25#1; 8534#L552-3 assume !(main_~i~3#1 < main_~out_len~0#1 - 1); 8488#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; 8489#L509 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8498#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8499#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; 8511#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; 8500#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8501#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; 8529#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; 8535#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8536#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; 8549#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; 8548#L510-4 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8547#L510-1 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 8546#L510-5 strlen_#res#1 := strlen_~i~0#1; 8545#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; 8544#L509-2 assume !(strlen_~s#1.base == 0 && strlen_~s#1.offset == 0);strlen_~i~0#1 := 0; 8503#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8504#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; 8568#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; 8567#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8506#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; 8538#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; 8537#L510-10 call strlen_#t~mem4#1 := read~int(strlen_~s#1.base, strlen_~s#1.offset, 1); 8507#L510-7 assume !(0 != strlen_#t~mem4#1);havoc strlen_#t~mem4#1; 8508#L510-11 strlen_#res#1 := strlen_~i~0#1; 8513#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; 8502#L530 assume !(0 == strstr_~nl~0#1 % 18446744073709551616); 8496#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); 8497#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; 8533#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; 8531#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8532#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; 8516#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; 8517#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8573#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; 8569#L519 assume 0 != memcmp_~r~0#1;havoc memcmp_#t~mem7#1;havoc memcmp_#t~mem8#1;memcmp_#res#1 := memcmp_~r~0#1; 8552#L524 strstr_#t~ret16#1 := memcmp_#res#1;assume { :end_inline_memcmp } true;strstr_#t~short17#1 := 0 == strstr_#t~ret16#1; 8542#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; 8540#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; 8539#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; 8522#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; 8515#L518-3 [2021-12-15 17:01:43,315 INFO L793 eck$LassoCheckResult]: Loop: 8515#L518-3 memcmp_#t~pre6#1 := memcmp_~count#1 - 1;memcmp_~count#1 := memcmp_~count#1 - 1; 8530#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; 8514#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; 8515#L518-3 [2021-12-15 17:01:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:01:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1792797110, now seen corresponding path program 3 times [2021-12-15 17:01:43,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:01:43,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159126742] [2021-12-15 17:01:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:01:43,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:01:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:01:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 17:01:43,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:01:43,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159126742] [2021-12-15 17:01:43,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159126742] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:01:43,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232268273] [2021-12-15 17:01:43,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:01:43,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:01:43,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:01:43,439 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) [2021-12-15 17:01:43,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2021-12-15 17:01:43,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 17:01:43,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:01:43,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 17:01:43,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:01:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-15 17:01:43,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:02:03,362 WARN L227 SmtUtils]: Spent 11.89s on a formula simplification. DAG size of input: 18 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)