./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a31fd051 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-crafted-lit/cstrpbrk.c -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 905898d576dbb9521171e998174a24819933fa88ed72107c9a2c3094e7696cea --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 14:14:18,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 14:14:18,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 14:14:18,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 14:14:18,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 14:14:18,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 14:14:18,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 14:14:18,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 14:14:18,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 14:14:18,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 14:14:18,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 14:14:18,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 14:14:18,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 14:14:18,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 14:14:18,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 14:14:18,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 14:14:18,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 14:14:18,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 14:14:18,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 14:14:18,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 14:14:18,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 14:14:18,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 14:14:18,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 14:14:18,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 14:14:18,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 14:14:18,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 14:14:18,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 14:14:19,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 14:14:19,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 14:14:19,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 14:14:19,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 14:14:19,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 14:14:19,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 14:14:19,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 14:14:19,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 14:14:19,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 14:14:19,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 14:14:19,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 14:14:19,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 14:14:19,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 14:14:19,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 14:14:19,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 14:14:19,032 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 14:14:19,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 14:14:19,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 14:14:19,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 14:14:19,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 14:14:19,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 14:14:19,034 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 14:14:19,035 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 14:14:19,035 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 14:14:19,035 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 14:14:19,035 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 14:14:19,036 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 14:14:19,036 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 14:14:19,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 14:14:19,036 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 14:14:19,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 14:14:19,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 14:14:19,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 14:14:19,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 14:14:19,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 14:14:19,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 14:14:19,037 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 14:14:19,037 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 14:14:19,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 14:14:19,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 14:14:19,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 14:14:19,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 14:14:19,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 14:14:19,039 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 14:14:19,039 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 -> 905898d576dbb9521171e998174a24819933fa88ed72107c9a2c3094e7696cea [2023-02-15 14:14:19,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 14:14:19,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 14:14:19,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 14:14:19,268 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 14:14:19,268 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 14:14:19,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c [2023-02-15 14:14:20,345 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 14:14:20,563 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 14:14:20,563 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c [2023-02-15 14:14:20,567 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d162d3fd/72101612041140c799d87a2967cfbade/FLAGf81af6867 [2023-02-15 14:14:20,577 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d162d3fd/72101612041140c799d87a2967cfbade [2023-02-15 14:14:20,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 14:14:20,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 14:14:20,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 14:14:20,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 14:14:20,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 14:14:20,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a31683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20, skipping insertion in model container [2023-02-15 14:14:20,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 14:14:20,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 14:14:20,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:14:20,723 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 14:14:20,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:14:20,746 INFO L208 MainTranslator]: Completed translation [2023-02-15 14:14:20,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20 WrapperNode [2023-02-15 14:14:20,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 14:14:20,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 14:14:20,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 14:14:20,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 14:14:20,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,772 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2023-02-15 14:14:20,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 14:14:20,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 14:14:20,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 14:14:20,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 14:14:20,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,801 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 14:14:20,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 14:14:20,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 14:14:20,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 14:14:20,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (1/1) ... [2023-02-15 14:14:20,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:20,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:20,828 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) [2023-02-15 14:14:20,831 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 [2023-02-15 14:14:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 14:14:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 14:14:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 14:14:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 14:14:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 14:14:20,901 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 14:14:20,902 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 14:14:21,060 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 14:14:21,072 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 14:14:21,073 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 14:14:21,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:21 BoogieIcfgContainer [2023-02-15 14:14:21,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 14:14:21,075 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 14:14:21,075 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 14:14:21,077 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 14:14:21,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:21,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:14:20" (1/3) ... [2023-02-15 14:14:21,094 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7554af62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:14:21, skipping insertion in model container [2023-02-15 14:14:21,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:21,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:20" (2/3) ... [2023-02-15 14:14:21,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7554af62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:14:21, skipping insertion in model container [2023-02-15 14:14:21,095 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:21,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:21" (3/3) ... [2023-02-15 14:14:21,096 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrpbrk.c [2023-02-15 14:14:21,152 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 14:14:21,153 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 14:14:21,153 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 14:14:21,153 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 14:14:21,153 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 14:14:21,153 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 14:14:21,153 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 14:14:21,154 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 14:14:21,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:21,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:14:21,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:21,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:21,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:21,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-15 14:14:21,173 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 14:14:21,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:21,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:14:21,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:21,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:21,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:21,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-15 14:14:21,182 INFO L748 eck$LassoCheckResult]: Stem: 16#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 7#L14true assume !(build_nondet_String_~length~0#1 < 1); 19#L14-2true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 2#build_nondet_String_returnLabel#1true main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 9#L14-3true assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 15#L14-5true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 14#build_nondet_String_returnLabel#2true main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 17#L31-4true [2023-02-15 14:14:21,183 INFO L750 eck$LassoCheckResult]: Loop: 17#L31-4true call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 18#L31-1true assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 11#L34-5true assume !true; 4#L34-6true call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 6#L36true assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 10#L31-3true cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 17#L31-4true [2023-02-15 14:14:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2023-02-15 14:14:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:21,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662938685] [2023-02-15 14:14:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:21,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:21,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:21,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2023-02-15 14:14:21,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:21,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435736898] [2023-02-15 14:14:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:21,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:21,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435736898] [2023-02-15 14:14:21,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435736898] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:21,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:21,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:14:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715261437] [2023-02-15 14:14:21,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:21,360 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:21,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 14:14:21,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 14:14:21,382 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:21,389 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-02-15 14:14:21,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2023-02-15 14:14:21,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:14:21,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2023-02-15 14:14:21,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-02-15 14:14:21,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-02-15 14:14:21,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2023-02-15 14:14:21,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:21,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 14:14:21,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2023-02-15 14:14:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-15 14:14:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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) [2023-02-15 14:14:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-02-15 14:14:21,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 14:14:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 14:14:21,427 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 14:14:21,427 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 14:14:21,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2023-02-15 14:14:21,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:14:21,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:21,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:21,429 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:21,429 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:21,429 INFO L748 eck$LassoCheckResult]: Stem: 64#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 55#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 56#L14 assume !(build_nondet_String_~length~0#1 < 1); 57#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 50#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 51#L14-3 assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 58#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 63#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 59#L31-4 [2023-02-15 14:14:21,430 INFO L750 eck$LassoCheckResult]: Loop: 59#L31-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 65#L31-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 60#L34-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 61#L34-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 62#L34-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 52#L34-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 53#L36 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 54#L31-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 59#L31-4 [2023-02-15 14:14:21,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2023-02-15 14:14:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:21,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004435222] [2023-02-15 14:14:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:21,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:21,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2023-02-15 14:14:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:21,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70448308] [2023-02-15 14:14:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:21,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:21,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:21,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:21,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2023-02-15 14:14:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:21,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174197900] [2023-02-15 14:14:21,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:21,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174197900] [2023-02-15 14:14:21,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174197900] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:21,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:21,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 14:14:21,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975407639] [2023-02-15 14:14:21,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:22,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 14:14:22,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 14:14:22,099 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:22,242 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2023-02-15 14:14:22,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2023-02-15 14:14:22,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-15 14:14:22,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 38 transitions. [2023-02-15 14:14:22,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-02-15 14:14:22,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-02-15 14:14:22,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2023-02-15 14:14:22,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:22,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-15 14:14:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2023-02-15 14:14:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-15 14:14:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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) [2023-02-15 14:14:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-15 14:14:22,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-15 14:14:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 14:14:22,250 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-15 14:14:22,251 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 14:14:22,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2023-02-15 14:14:22,251 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-15 14:14:22,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:22,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:22,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:22,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:22,254 INFO L748 eck$LassoCheckResult]: Stem: 139#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 128#L14 assume !(build_nondet_String_~length~0#1 < 1); 130#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 123#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 124#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 131#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 137#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 133#L31-4 [2023-02-15 14:14:22,254 INFO L750 eck$LassoCheckResult]: Loop: 133#L31-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 140#L31-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 141#L34-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 144#L34-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 143#L34-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 125#L34-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 126#L36 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 129#L31-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 133#L31-4 [2023-02-15 14:14:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2023-02-15 14:14:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:22,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039707710] [2023-02-15 14:14:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:22,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2023-02-15 14:14:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:22,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388168577] [2023-02-15 14:14:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2023-02-15 14:14:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:22,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606212806] [2023-02-15 14:14:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:22,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:23,060 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:23,060 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:23,061 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:23,061 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:23,061 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:23,061 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:23,061 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:23,061 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:23,061 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration3_Lasso [2023-02-15 14:14:23,061 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:23,062 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:23,076 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,465 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,467 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,473 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,475 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,477 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,478 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,481 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,482 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,484 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,486 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,487 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,489 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,491 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,493 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,494 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,498 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,500 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:24,255 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:24,259 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:24,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:24,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:24,269 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) [2023-02-15 14:14:24,270 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 [2023-02-15 14:14:24,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:24,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:24,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:24,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:24,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:24,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:24,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:24,302 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:24,325 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-02-15 14:14:24,325 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-02-15 14:14:24,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:24,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:24,359 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) [2023-02-15 14:14:24,391 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 [2023-02-15 14:14:24,391 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:24,411 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 14:14:24,412 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:24,412 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1 Supporting invariants [] [2023-02-15 14:14:24,441 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 [2023-02-15 14:14:24,454 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2023-02-15 14:14:24,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,514 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 [2023-02-15 14:14:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:24,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:24,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:24,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:24,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:24,604 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 14:14:24,610 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:24,670 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 62 transitions. Complement of second has 4 states. [2023-02-15 14:14:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:14:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2023-02-15 14:14:24,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2023-02-15 14:14:24,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:24,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2023-02-15 14:14:24,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:24,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2023-02-15 14:14:24,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:24,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2023-02-15 14:14:24,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-15 14:14:24,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 56 transitions. [2023-02-15 14:14:24,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-02-15 14:14:24,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-02-15 14:14:24,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2023-02-15 14:14:24,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:24,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2023-02-15 14:14:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2023-02-15 14:14:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2023-02-15 14:14:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2023-02-15 14:14:24,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 47 transitions. [2023-02-15 14:14:24,696 INFO L428 stractBuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2023-02-15 14:14:24,696 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 14:14:24,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2023-02-15 14:14:24,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:24,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:24,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:24,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:24,698 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:24,698 INFO L748 eck$LassoCheckResult]: Stem: 315#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 302#L14 assume !(build_nondet_String_~length~0#1 < 1); 303#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 296#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 297#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 305#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 328#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 316#L31-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 318#L31-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 307#L34-5 [2023-02-15 14:14:24,698 INFO L750 eck$LassoCheckResult]: Loop: 307#L34-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 308#L34-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 311#L34-3 assume !!cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1;cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post8#1.base, 1 + cstrpbrk_#t~post8#1.offset;havoc cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset; 307#L34-5 [2023-02-15 14:14:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2023-02-15 14:14:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:24,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133339413] [2023-02-15 14:14:24,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:24,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2023-02-15 14:14:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:24,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213142191] [2023-02-15 14:14:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2023-02-15 14:14:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:24,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646088891] [2023-02-15 14:14:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:25,424 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:25,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:25,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:25,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:25,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:25,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:25,424 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:25,424 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:25,424 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration4_Lasso [2023-02-15 14:14:25,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:25,424 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:25,427 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,431 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,432 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,434 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,436 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,437 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,439 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,441 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,443 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,445 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,447 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,449 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,451 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,452 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,454 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,456 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,458 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,460 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,463 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,465 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,640 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:26,642 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:26,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,653 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) [2023-02-15 14:14:26,654 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 [2023-02-15 14:14:26,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:26,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:26,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:26,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-15 14:14:26,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,676 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) [2023-02-15 14:14:26,677 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 [2023-02-15 14:14:26,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:26,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:26,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:26,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,700 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 [2023-02-15 14:14:26,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,701 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) [2023-02-15 14:14:26,703 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 [2023-02-15 14:14:26,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:26,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:26,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,752 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 [2023-02-15 14:14:26,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,754 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) [2023-02-15 14:14:26,756 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 [2023-02-15 14:14:26,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:26,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:26,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:26,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,774 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 [2023-02-15 14:14:26,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,776 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) [2023-02-15 14:14:26,778 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 [2023-02-15 14:14:26,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:26,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:26,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:26,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,807 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 [2023-02-15 14:14:26,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,811 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) [2023-02-15 14:14:26,822 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 [2023-02-15 14:14:26,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 [2023-02-15 14:14:26,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:26,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:26,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:26,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-02-15 14:14:26,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,848 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) [2023-02-15 14:14:26,850 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 [2023-02-15 14:14:26,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:26,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:26,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:26,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,861 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 [2023-02-15 14:14:26,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,863 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) [2023-02-15 14:14:26,865 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 [2023-02-15 14:14:26,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:26,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:26,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,888 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 [2023-02-15 14:14:26,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,890 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) [2023-02-15 14:14:26,905 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 [2023-02-15 14:14:26,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:26,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:26,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:26,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-02-15 14:14:26,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,927 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) [2023-02-15 14:14:26,929 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 [2023-02-15 14:14:26,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:26,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:26,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:26,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:26,948 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 [2023-02-15 14:14:26,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:26,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:26,950 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) [2023-02-15 14:14:26,951 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 [2023-02-15 14:14:26,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:26,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:26,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:26,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:26,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:26,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:26,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:26,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:26,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-02-15 14:14:27,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,013 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) [2023-02-15 14:14:27,013 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 [2023-02-15 14:14:27,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,026 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 [2023-02-15 14:14:27,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,027 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) [2023-02-15 14:14:27,027 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 [2023-02-15 14:14:27,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:27,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,042 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) [2023-02-15 14:14:27,043 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 [2023-02-15 14:14:27,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-02-15 14:14:27,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,058 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) [2023-02-15 14:14:27,060 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 [2023-02-15 14:14:27,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:27,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,082 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) [2023-02-15 14:14:27,086 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 [2023-02-15 14:14:27,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,097 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 [2023-02-15 14:14:27,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,098 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) [2023-02-15 14:14:27,101 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 [2023-02-15 14:14:27,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,120 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 [2023-02-15 14:14:27,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,121 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) [2023-02-15 14:14:27,123 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 [2023-02-15 14:14:27,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,158 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 [2023-02-15 14:14:27,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,160 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) [2023-02-15 14:14:27,162 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 [2023-02-15 14:14:27,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,188 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 [2023-02-15 14:14:27,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,189 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) [2023-02-15 14:14:27,191 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 [2023-02-15 14:14:27,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,207 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 [2023-02-15 14:14:27,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,209 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) [2023-02-15 14:14:27,209 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 [2023-02-15 14:14:27,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:27,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:27,247 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:27,257 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-02-15 14:14:27,257 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-02-15 14:14:27,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,273 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) [2023-02-15 14:14:27,276 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 [2023-02-15 14:14:27,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:27,298 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 14:14:27,298 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:27,298 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0#1.base)_2, ULTIMATE.start_cstrpbrk_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0#1.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0#1.offset Supporting invariants [] [2023-02-15 14:14:27,301 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 [2023-02-15 14:14:27,319 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2023-02-15 14:14:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:27,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:14:27,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:27,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:14:27,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:27,370 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 14:14:27,370 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:27,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 81 states and 107 transitions. Complement of second has 5 states. [2023-02-15 14:14:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:14:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-02-15 14:14:27,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 3 letters. [2023-02-15 14:14:27,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:27,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 13 letters. Loop has 3 letters. [2023-02-15 14:14:27,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:27,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 6 letters. [2023-02-15 14:14:27,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:27,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2023-02-15 14:14:27,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:27,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 61 states and 80 transitions. [2023-02-15 14:14:27,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-15 14:14:27,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-02-15 14:14:27,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 80 transitions. [2023-02-15 14:14:27,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:27,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 80 transitions. [2023-02-15 14:14:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 80 transitions. [2023-02-15 14:14:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2023-02-15 14:14:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 47 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2023-02-15 14:14:27,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 64 transitions. [2023-02-15 14:14:27,416 INFO L428 stractBuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2023-02-15 14:14:27,416 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 14:14:27,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2023-02-15 14:14:27,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:27,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:27,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:27,417 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:27,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:27,417 INFO L748 eck$LassoCheckResult]: Stem: 524#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 508#L14 assume !(build_nondet_String_~length~0#1 < 1); 511#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 503#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 504#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 512#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 523#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 541#L31-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 539#L31-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 535#L34-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 532#L34-1 assume !cstrpbrk_#t~short7#1; 533#L34-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 548#L34-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 509#L36 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 510#L31-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 514#L31-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 527#L31-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 515#L34-5 [2023-02-15 14:14:27,417 INFO L750 eck$LassoCheckResult]: Loop: 515#L34-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 516#L34-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 519#L34-3 assume !!cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1;cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post8#1.base, 1 + cstrpbrk_#t~post8#1.offset;havoc cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset; 515#L34-5 [2023-02-15 14:14:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2023-02-15 14:14:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:27,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534026429] [2023-02-15 14:14:27,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:27,529 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 [2023-02-15 14:14:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:27,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:27,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534026429] [2023-02-15 14:14:27,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534026429] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:27,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:27,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 14:14:27,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142075676] [2023-02-15 14:14:27,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:27,558 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:14:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:27,558 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2023-02-15 14:14:27,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:27,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762442006] [2023-02-15 14:14:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:27,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:27,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:27,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 14:14:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 14:14:27,634 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:27,688 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2023-02-15 14:14:27,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2023-02-15 14:14:27,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:14:27,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 54 states and 68 transitions. [2023-02-15 14:14:27,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-15 14:14:27,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-02-15 14:14:27,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 68 transitions. [2023-02-15 14:14:27,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:27,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 68 transitions. [2023-02-15 14:14:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 68 transitions. [2023-02-15 14:14:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2023-02-15 14:14:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2023-02-15 14:14:27,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 63 transitions. [2023-02-15 14:14:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 14:14:27,695 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2023-02-15 14:14:27,695 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 14:14:27,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2023-02-15 14:14:27,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:27,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:27,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:27,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:27,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:27,696 INFO L748 eck$LassoCheckResult]: Stem: 649#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 633#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 634#L14 assume !(build_nondet_String_~length~0#1 < 1); 636#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 629#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 630#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 637#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 647#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset, cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrpbrk_#res#1.base, cstrpbrk_#res#1.offset;havoc cstrpbrk_#t~mem4#1, cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset, cstrpbrk_#t~mem5#1, cstrpbrk_#t~mem6#1, cstrpbrk_#t~short7#1, cstrpbrk_#t~mem9#1, cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset, cstrpbrk_#t~mem3#1, cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset, cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset, cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, cstrpbrk_~c~0#1;cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset := cstrpbrk_#in~s1#1.base, cstrpbrk_#in~s1#1.offset;cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset := cstrpbrk_#in~s2#1.base, cstrpbrk_#in~s2#1.offset;havoc cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;havoc cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;havoc cstrpbrk_~c~0#1;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_~s1#1.base, cstrpbrk_~s1#1.offset; 648#L31-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 667#L31-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 662#L34-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 663#L34-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 658#L34-3 assume !cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1; 631#L34-6 call cstrpbrk_#t~mem9#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1); 632#L36 assume !(cstrpbrk_#t~mem9#1 != cstrpbrk_~c~0#1);havoc cstrpbrk_#t~mem9#1; 635#L31-3 cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset := cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset;cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset := cstrpbrk_#t~post2#1.base, 1 + cstrpbrk_#t~post2#1.offset;havoc cstrpbrk_#t~post2#1.base, cstrpbrk_#t~post2#1.offset; 639#L31-4 call cstrpbrk_#t~mem3#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1); 654#L31-1 assume !!(0 != cstrpbrk_#t~mem3#1);havoc cstrpbrk_#t~mem3#1;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_~s2#1.base, cstrpbrk_~s2#1.offset;call cstrpbrk_#t~mem4#1 := read~int(cstrpbrk_~sc1~0#1.base, cstrpbrk_~sc1~0#1.offset, 1);cstrpbrk_~c~0#1 := cstrpbrk_#t~mem4#1;havoc cstrpbrk_#t~mem4#1; 640#L34-5 [2023-02-15 14:14:27,697 INFO L750 eck$LassoCheckResult]: Loop: 640#L34-5 call cstrpbrk_#t~mem5#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := 0 != cstrpbrk_#t~mem5#1; 641#L34-1 assume cstrpbrk_#t~short7#1;call cstrpbrk_#t~mem6#1 := read~int(cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset, 1);cstrpbrk_#t~short7#1 := cstrpbrk_#t~mem6#1 != (if cstrpbrk_~c~0#1 % 256 <= 127 then cstrpbrk_~c~0#1 % 256 else cstrpbrk_~c~0#1 % 256 - 256); 644#L34-3 assume !!cstrpbrk_#t~short7#1;havoc cstrpbrk_#t~mem5#1;havoc cstrpbrk_#t~mem6#1;havoc cstrpbrk_#t~short7#1;cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset := cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset;cstrpbrk_~s~0#1.base, cstrpbrk_~s~0#1.offset := cstrpbrk_#t~post8#1.base, 1 + cstrpbrk_#t~post8#1.offset;havoc cstrpbrk_#t~post8#1.base, cstrpbrk_#t~post8#1.offset; 640#L34-5 [2023-02-15 14:14:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2023-02-15 14:14:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:27,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880059534] [2023-02-15 14:14:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:27,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:27,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2023-02-15 14:14:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:27,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322632618] [2023-02-15 14:14:27,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:27,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:27,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2023-02-15 14:14:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:27,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922340398] [2023-02-15 14:14:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:27,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:27,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:27,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:28,638 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:28,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:28,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:28,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:28,639 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:28,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:28,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:28,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:28,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration6_Lasso [2023-02-15 14:14:28,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:28,639 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:28,642 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,262 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,264 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,265 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,266 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,267 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,268 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,270 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,272 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,274 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,276 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,277 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,278 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,278 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,279 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,281 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,282 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,283 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:29,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:30,212 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:30,212 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:30,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:30,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:30,214 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) [2023-02-15 14:14:30,243 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 [2023-02-15 14:14:30,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:30,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:30,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:30,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:30,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:30,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:30,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:30,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:30,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-02-15 14:14:30,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:30,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:30,271 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) [2023-02-15 14:14:30,293 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 [2023-02-15 14:14:30,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:30,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:30,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:30,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:30,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:30,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:30,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:30,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:30,361 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-02-15 14:14:30,361 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-02-15 14:14:30,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:30,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:30,368 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) [2023-02-15 14:14:30,371 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 [2023-02-15 14:14:30,372 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:30,378 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 14:14:30,379 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:30,379 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0#1.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3 Supporting invariants [] [2023-02-15 14:14:30,385 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 [2023-02-15 14:14:30,442 INFO L156 tatePredicateManager]: 18 out of 20 supporting invariants were superfluous and have been removed [2023-02-15 14:14:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:30,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:30,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:30,566 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 [2023-02-15 14:14:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:30,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:14:30,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:30,594 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-15 14:14:30,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19 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) [2023-02-15 14:14:30,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19. 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) Result 79 states and 99 transitions. Complement of second has 7 states. [2023-02-15 14:14:30,641 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 [2023-02-15 14:14:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2023-02-15 14:14:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2023-02-15 14:14:30,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-15 14:14:30,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:30,642 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:30,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:30,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:30,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:14:30,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:30,751 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-15 14:14:30,752 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19 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) [2023-02-15 14:14:30,794 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19. 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) Result 79 states and 99 transitions. Complement of second has 7 states. [2023-02-15 14:14:30,794 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 [2023-02-15 14:14:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2023-02-15 14:14:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2023-02-15 14:14:30,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-15 14:14:30,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:30,796 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:30,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:30,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:30,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 14:14:30,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:30,913 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-15 14:14:30,914 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19 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) [2023-02-15 14:14:30,959 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19. 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) Result 78 states and 102 transitions. Complement of second has 6 states. [2023-02-15 14:14:30,960 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 [2023-02-15 14:14:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2023-02-15 14:14:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2023-02-15 14:14:30,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-15 14:14:30,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:30,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 21 letters. Loop has 3 letters. [2023-02-15 14:14:30,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:30,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 6 letters. [2023-02-15 14:14:30,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:30,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 102 transitions. [2023-02-15 14:14:30,963 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-15 14:14:30,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2023-02-15 14:14:30,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-15 14:14:30,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-15 14:14:30,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-15 14:14:30,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:30,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:14:30,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:14:30,964 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:14:30,964 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 14:14:30,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-15 14:14:30,964 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-15 14:14:30,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-15 14:14:30,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.02 02:14:30 BoogieIcfgContainer [2023-02-15 14:14:30,970 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-15 14:14:30,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 14:14:30,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 14:14:30,971 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 14:14:30,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:21" (3/4) ... [2023-02-15 14:14:30,973 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 14:14:30,973 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 14:14:30,973 INFO L158 Benchmark]: Toolchain (without parser) took 10394.01ms. Allocated memory was 176.2MB in the beginning and 323.0MB in the end (delta: 146.8MB). Free memory was 144.6MB in the beginning and 242.0MB in the end (delta: -97.4MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2023-02-15 14:14:30,974 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:14:30,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.72ms. Allocated memory is still 176.2MB. Free memory was 144.6MB in the beginning and 133.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 14:14:30,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.38ms. Allocated memory is still 176.2MB. Free memory was 133.6MB in the beginning and 132.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:14:30,974 INFO L158 Benchmark]: Boogie Preprocessor took 29.80ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 130.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:14:30,975 INFO L158 Benchmark]: RCFGBuilder took 270.44ms. Allocated memory is still 176.2MB. Free memory was 130.6MB in the beginning and 118.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 14:14:30,975 INFO L158 Benchmark]: BuchiAutomizer took 9895.17ms. Allocated memory was 176.2MB in the beginning and 323.0MB in the end (delta: 146.8MB). Free memory was 118.0MB in the beginning and 243.0MB in the end (delta: -125.1MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2023-02-15 14:14:30,975 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 323.0MB. Free memory was 243.0MB in the beginning and 242.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:14:30,977 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.72ms. Allocated memory is still 176.2MB. Free memory was 144.6MB in the beginning and 133.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.38ms. Allocated memory is still 176.2MB. Free memory was 133.6MB in the beginning and 132.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.80ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 130.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 270.44ms. Allocated memory is still 176.2MB. Free memory was 130.6MB in the beginning and 118.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9895.17ms. Allocated memory was 176.2MB in the beginning and 323.0MB in the end (delta: 146.8MB). Free memory was 118.0MB in the beginning and 243.0MB in the end (delta: -125.1MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 323.0MB. Free memory was 243.0MB in the beginning and 242.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 8.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 143 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital298 mio100 ax100 hnf100 lsp103 ukn72 mio100 lsp29 div165 bol100 ite100 ukn100 eq159 hnf100 smp68 dnf581 smp50 tf100 neg95 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 152ms VariablesStem: 10 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-02-15 14:14:30,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE