./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 2329fc70 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-?-2329fc7 [2023-02-14 03:07:32,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 03:07:32,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 03:07:32,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 03:07:32,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 03:07:32,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 03:07:32,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 03:07:32,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 03:07:32,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 03:07:32,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 03:07:32,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 03:07:32,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 03:07:32,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 03:07:32,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 03:07:32,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 03:07:32,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 03:07:32,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 03:07:32,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 03:07:32,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 03:07:32,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 03:07:32,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 03:07:32,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 03:07:32,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 03:07:32,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 03:07:32,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 03:07:32,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 03:07:32,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 03:07:32,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 03:07:32,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 03:07:32,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 03:07:32,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 03:07:32,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 03:07:32,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 03:07:32,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 03:07:32,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 03:07:32,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 03:07:32,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 03:07:32,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 03:07:32,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 03:07:32,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 03:07:32,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 03:07:32,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-14 03:07:32,784 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 03:07:32,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 03:07:32,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 03:07:32,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 03:07:32,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 03:07:32,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 03:07:32,787 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 03:07:32,787 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-14 03:07:32,788 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-14 03:07:32,788 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-14 03:07:32,789 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-14 03:07:32,789 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-14 03:07:32,789 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-14 03:07:32,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 03:07:32,789 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 03:07:32,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 03:07:32,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 03:07:32,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-14 03:07:32,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-14 03:07:32,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-14 03:07:32,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 03:07:32,791 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-14 03:07:32,791 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 03:07:32,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-14 03:07:32,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 03:07:32,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 03:07:32,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 03:07:32,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 03:07:32,794 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-14 03:07:32,795 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-14 03:07:33,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 03:07:33,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 03:07:33,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 03:07:33,079 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 03:07:33,079 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 03:07:33,080 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-14 03:07:34,201 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 03:07:34,363 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 03:07:34,364 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c [2023-02-14 03:07:34,369 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffe0ad1f/b47662da3d1e4d97bdacafb5cb4d01c6/FLAG905672fb6 [2023-02-14 03:07:34,387 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffe0ad1f/b47662da3d1e4d97bdacafb5cb4d01c6 [2023-02-14 03:07:34,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 03:07:34,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 03:07:34,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 03:07:34,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 03:07:34,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 03:07:34,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a5b48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34, skipping insertion in model container [2023-02-14 03:07:34,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 03:07:34,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 03:07:34,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 03:07:34,549 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 03:07:34,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 03:07:34,575 INFO L208 MainTranslator]: Completed translation [2023-02-14 03:07:34,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34 WrapperNode [2023-02-14 03:07:34,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 03:07:34,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 03:07:34,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 03:07:34,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 03:07:34,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,615 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2023-02-14 03:07:34,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 03:07:34,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 03:07:34,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 03:07:34,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 03:07:34,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,642 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 03:07:34,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 03:07:34,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 03:07:34,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 03:07:34,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (1/1) ... [2023-02-14 03:07:34,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:34,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:34,672 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-14 03:07:34,683 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-14 03:07:34,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 03:07:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 03:07:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 03:07:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 03:07:34,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 03:07:34,770 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 03:07:34,772 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 03:07:34,915 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 03:07:34,921 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 03:07:34,921 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 03:07:34,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:07:34 BoogieIcfgContainer [2023-02-14 03:07:34,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 03:07:34,924 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-14 03:07:34,924 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-14 03:07:34,927 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-14 03:07:34,928 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:07:34,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.02 03:07:34" (1/3) ... [2023-02-14 03:07:34,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62ce6567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 03:07:34, skipping insertion in model container [2023-02-14 03:07:34,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:07:34,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 03:07:34" (2/3) ... [2023-02-14 03:07:34,929 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62ce6567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.02 03:07:34, skipping insertion in model container [2023-02-14 03:07:34,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-14 03:07:34,929 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:07:34" (3/3) ... [2023-02-14 03:07:34,931 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrpbrk.c [2023-02-14 03:07:34,972 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-14 03:07:34,973 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-14 03:07:34,973 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-14 03:07:34,973 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-14 03:07:34,973 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-14 03:07:34,973 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-14 03:07:34,973 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-14 03:07:34,974 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-14 03:07:34,977 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-14 03:07:35,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 03:07:35,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:35,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:35,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:35,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 03:07:35,007 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-14 03:07:35,008 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-14 03:07:35,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 03:07:35,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:35,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:35,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:35,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-14 03:07:35,025 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-14 03:07:35,026 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-14 03:07:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2023-02-14 03:07:35,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:35,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506174773] [2023-02-14 03:07:35,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:35,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:35,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:35,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:35,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:35,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2023-02-14 03:07:35,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:35,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177070630] [2023-02-14 03:07:35,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:35,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:35,339 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-14 03:07:35,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:35,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177070630] [2023-02-14 03:07:35,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177070630] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:07:35,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:07:35,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 03:07:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485775046] [2023-02-14 03:07:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:07:35,345 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-14 03:07:35,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:35,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 03:07:35,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 03:07:35,374 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-14 03:07:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:35,382 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-02-14 03:07:35,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2023-02-14 03:07:35,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 03:07:35,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2023-02-14 03:07:35,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-02-14 03:07:35,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-02-14 03:07:35,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2023-02-14 03:07:35,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 03:07:35,390 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-14 03:07:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2023-02-14 03:07:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-14 03:07:35,408 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-14 03:07:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-02-14 03:07:35,409 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-14 03:07:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 03:07:35,413 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-14 03:07:35,414 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-14 03:07:35,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2023-02-14 03:07:35,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-14 03:07:35,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:35,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:35,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:35,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:35,416 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-14 03:07:35,417 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-14 03:07:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:35,418 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2023-02-14 03:07:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:35,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43764313] [2023-02-14 03:07:35,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:35,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:35,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:35,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2023-02-14 03:07:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:35,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154433367] [2023-02-14 03:07:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:35,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:35,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:35,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2023-02-14 03:07:35,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:35,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422134396] [2023-02-14 03:07:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:36,079 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-14 03:07:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:36,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422134396] [2023-02-14 03:07:36,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422134396] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:07:36,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:07:36,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 03:07:36,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425336207] [2023-02-14 03:07:36,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:07:36,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:36,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 03:07:36,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 03:07:36,398 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-14 03:07:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:36,574 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2023-02-14 03:07:36,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2023-02-14 03:07:36,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-14 03:07:36,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 38 transitions. [2023-02-14 03:07:36,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-02-14 03:07:36,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-02-14 03:07:36,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2023-02-14 03:07:36,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 03:07:36,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-14 03:07:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2023-02-14 03:07:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-14 03:07:36,592 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-14 03:07:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-14 03:07:36,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-14 03:07:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 03:07:36,595 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-14 03:07:36,595 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-14 03:07:36,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2023-02-14 03:07:36,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-14 03:07:36,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:36,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:36,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:36,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:36,600 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-14 03:07:36,600 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-14 03:07:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2023-02-14 03:07:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:36,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172804958] [2023-02-14 03:07:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:36,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:36,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:36,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:36,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2023-02-14 03:07:36,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:36,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900541396] [2023-02-14 03:07:36,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:36,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:36,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:36,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2023-02-14 03:07:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:36,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037022339] [2023-02-14 03:07:36,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:36,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:36,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:36,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:37,531 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:37,532 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:37,532 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:37,532 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:37,532 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:07:37,532 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:37,533 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:37,533 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:37,533 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration3_Lasso [2023-02-14 03:07:37,533 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:37,533 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:37,554 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-14 03:07:38,044 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-14 03:07:38,050 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-14 03:07:38,052 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-14 03:07:38,054 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-14 03:07:38,058 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-14 03:07:38,060 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-14 03:07:38,063 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-14 03:07:38,065 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-14 03:07:38,068 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-14 03:07:38,070 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-14 03:07:38,073 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-14 03:07:38,075 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-14 03:07:38,077 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-14 03:07:38,079 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-14 03:07:38,081 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-14 03:07:38,083 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-14 03:07:38,085 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-14 03:07:38,088 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-14 03:07:38,090 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-14 03:07:38,092 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-14 03:07:39,015 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:39,018 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:07:39,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:39,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:39,021 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-14 03:07:39,026 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-14 03:07:39,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:39,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:39,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:39,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:39,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:39,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:39,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:07:39,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:07:39,094 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-02-14 03:07:39,094 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-02-14 03:07:39,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:39,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:39,117 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-14 03:07:39,167 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:07:39,176 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-14 03:07:39,188 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-14 03:07:39,189 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:07:39,189 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-14 03:07:39,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:39,216 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2023-02-14 03:07:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:39,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 03:07:39,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:39,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 03:07:39,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:39,386 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-14 03:07:39,389 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-14 03:07:39,390 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-14 03:07:39,449 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-14 03:07:39,450 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-14 03:07:39,451 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-14 03:07:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2023-02-14 03:07:39,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2023-02-14 03:07:39,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:39,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2023-02-14 03:07:39,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:39,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2023-02-14 03:07:39,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:39,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2023-02-14 03:07:39,458 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-14 03:07:39,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 56 transitions. [2023-02-14 03:07:39,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-02-14 03:07:39,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-02-14 03:07:39,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2023-02-14 03:07:39,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:39,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2023-02-14 03:07:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2023-02-14 03:07:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2023-02-14 03:07:39,465 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-14 03:07:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2023-02-14 03:07:39,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 47 transitions. [2023-02-14 03:07:39,466 INFO L428 stractBuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2023-02-14 03:07:39,466 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-14 03:07:39,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2023-02-14 03:07:39,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 03:07:39,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:39,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:39,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:39,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:07:39,469 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-14 03:07:39,470 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-14 03:07:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2023-02-14 03:07:39,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:39,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125242064] [2023-02-14 03:07:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:39,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:39,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:39,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:39,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2023-02-14 03:07:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703458961] [2023-02-14 03:07:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:39,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:39,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2023-02-14 03:07:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:39,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467765358] [2023-02-14 03:07:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:39,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-02-14 03:07:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:39,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:39,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:40,424 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:40,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:40,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:40,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:40,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:07:40,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:40,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:40,425 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:40,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration4_Lasso [2023-02-14 03:07:40,425 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:40,425 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:40,428 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-14 03:07:40,433 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-14 03:07:40,435 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-14 03:07:40,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-14 03:07:40,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-14 03:07:40,442 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-14 03:07:40,444 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-14 03:07:40,446 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-14 03:07:40,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-14 03:07:40,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-14 03:07:40,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-14 03:07:40,457 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-14 03:07:40,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-14 03:07:40,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-14 03:07:40,464 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-14 03:07:40,466 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-14 03:07:40,468 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-14 03:07:40,470 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-14 03:07:40,472 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-14 03:07:40,474 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-14 03:07:40,476 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-14 03:07:41,936 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:41,939 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:07:41,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:41,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:41,943 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-14 03:07:41,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:41,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:41,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:41,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:41,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:41,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:41,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:41,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:41,968 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-14 03:07:41,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:41,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:41,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:41,985 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-14 03:07:41,988 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-14 03:07:41,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:41,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:41,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:41,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:41,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:41,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:41,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:41,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,021 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-14 03:07:42,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,023 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-14 03:07:42,026 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-14 03:07:42,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:42,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:07:42,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,060 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-14 03:07:42,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,063 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-14 03:07:42,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,086 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-14 03:07:42,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,103 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-14 03:07:42,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,106 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-14 03:07:42,108 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-14 03:07:42,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,141 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-14 03:07:42,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,144 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-14 03:07:42,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,163 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-14 03:07:42,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:42,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,189 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-14 03:07:42,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,206 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-14 03:07:42,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,225 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-14 03:07:42,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,227 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-14 03:07:42,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:42,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:07:42,249 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-14 03:07:42,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,264 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-14 03:07:42,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,266 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-14 03:07:42,269 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-14 03:07:42,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 03:07:42,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:42,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,296 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-14 03:07:42,296 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-14 03:07:42,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,309 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-14 03:07:42,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,311 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-14 03:07:42,312 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-14 03:07:42,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:42,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,326 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-14 03:07:42,327 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-14 03:07:42,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 03:07:42,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-02-14 03:07:42,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,346 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-14 03:07:42,348 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-14 03:07:42,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,360 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-14 03:07:42,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,362 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-14 03:07:42,364 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-14 03:07:42,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-14 03:07:42,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,381 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-14 03:07:42,382 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-14 03:07:42,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,397 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-14 03:07:42,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,398 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-14 03:07:42,400 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-14 03:07:42,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,416 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-14 03:07:42,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,421 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-14 03:07:42,424 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-14 03:07:42,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,474 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-14 03:07:42,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,476 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-14 03:07:42,485 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-14 03:07:42,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 03:07:42,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,495 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,517 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-14 03:07:42,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,519 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-14 03:07:42,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,534 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-14 03:07:42,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,562 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-14 03:07:42,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,564 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-14 03:07:42,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-14 03:07:42,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-14 03:07:42,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-14 03:07:42,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-14 03:07:42,583 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-14 03:07:42,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:42,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-02-14 03:07:42,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,598 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-14 03:07:42,600 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-14 03:07:42,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:42,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:42,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:42,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:42,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:42,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:42,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:07:42,641 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:07:42,656 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-02-14 03:07:42,656 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-02-14 03:07:42,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:42,662 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-14 03:07:42,664 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-14 03:07:42,666 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:07:42,687 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-14 03:07:42,687 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:07:42,687 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0#1.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0#1.base)_2 Supporting invariants [] [2023-02-14 03:07:42,699 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-14 03:07:42,720 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2023-02-14 03:07:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:42,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 03:07:42,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:42,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 03:07:42,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:42,793 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-14 03:07:42,793 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-14 03:07:42,794 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-14 03:07:42,818 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-14 03:07:42,819 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-14 03:07:42,820 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-14 03:07:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-02-14 03:07:42,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 3 letters. [2023-02-14 03:07:42,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:42,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 13 letters. Loop has 3 letters. [2023-02-14 03:07:42,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:42,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 6 letters. [2023-02-14 03:07:42,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:42,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2023-02-14 03:07:42,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 03:07:42,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 61 states and 80 transitions. [2023-02-14 03:07:42,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-14 03:07:42,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-02-14 03:07:42,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 80 transitions. [2023-02-14 03:07:42,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:42,823 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 80 transitions. [2023-02-14 03:07:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 80 transitions. [2023-02-14 03:07:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2023-02-14 03:07:42,826 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-14 03:07:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2023-02-14 03:07:42,827 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 64 transitions. [2023-02-14 03:07:42,827 INFO L428 stractBuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2023-02-14 03:07:42,827 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-14 03:07:42,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2023-02-14 03:07:42,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 03:07:42,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:42,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:42,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:42,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:07:42,829 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-14 03:07:42,829 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-14 03:07:42,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2023-02-14 03:07:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:42,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930623130] [2023-02-14 03:07:42,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:42,902 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-14 03:07:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 03:07:42,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930623130] [2023-02-14 03:07:42,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930623130] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 03:07:42,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 03:07:42,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 03:07:42,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646304410] [2023-02-14 03:07:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 03:07:42,903 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-14 03:07:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:42,903 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2023-02-14 03:07:42,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:42,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636334719] [2023-02-14 03:07:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:42,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:42,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:42,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 03:07:43,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 03:07:43,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-14 03:07:43,001 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-14 03:07:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 03:07:43,069 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2023-02-14 03:07:43,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2023-02-14 03:07:43,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-14 03:07:43,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 54 states and 68 transitions. [2023-02-14 03:07:43,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-14 03:07:43,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-02-14 03:07:43,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 68 transitions. [2023-02-14 03:07:43,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-14 03:07:43,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 68 transitions. [2023-02-14 03:07:43,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 68 transitions. [2023-02-14 03:07:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2023-02-14 03:07:43,075 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-14 03:07:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2023-02-14 03:07:43,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 63 transitions. [2023-02-14 03:07:43,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 03:07:43,077 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2023-02-14 03:07:43,077 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-14 03:07:43,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2023-02-14 03:07:43,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-14 03:07:43,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-14 03:07:43,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-14 03:07:43,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 03:07:43,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-14 03:07:43,079 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-14 03:07:43,079 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-14 03:07:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2023-02-14 03:07:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:43,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956669234] [2023-02-14 03:07:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:43,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2023-02-14 03:07:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:43,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594712907] [2023-02-14 03:07:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2023-02-14 03:07:43,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 03:07:43,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699546562] [2023-02-14 03:07:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 03:07:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 03:07:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 03:07:43,142 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-14 03:07:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 03:07:43,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 03:07:44,313 INFO L210 LassoAnalysis]: Preferences: [2023-02-14 03:07:44,313 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-14 03:07:44,313 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-14 03:07:44,313 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-14 03:07:44,313 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-14 03:07:44,313 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:44,313 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-14 03:07:44,313 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-14 03:07:44,313 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration6_Lasso [2023-02-14 03:07:44,313 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-14 03:07:44,314 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-14 03:07:44,317 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-14 03:07:45,001 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-14 03:07:45,004 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-14 03:07:45,006 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-14 03:07:45,007 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-14 03:07:45,010 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-14 03:07:45,012 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-14 03:07:45,014 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-14 03:07:45,015 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-14 03:07:45,017 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-14 03:07:45,020 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-14 03:07:45,022 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-14 03:07:45,024 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-14 03:07:45,025 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-14 03:07:45,027 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-14 03:07:45,029 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-14 03:07:45,031 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-14 03:07:45,032 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-14 03:07:45,034 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-14 03:07:45,036 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-14 03:07:45,038 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-14 03:07:46,142 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-14 03:07:46,143 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-14 03:07:46,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,145 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-14 03:07:46,147 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-14 03:07:46,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:46,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:46,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:46,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:46,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:07:46,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-14 03:07:46,162 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-14 03:07:46,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,163 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-14 03:07:46,165 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-14 03:07:46,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 03:07:46,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-14 03:07:46,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-14 03:07:46,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-14 03:07:46,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-14 03:07:46,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-14 03:07:46,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-14 03:07:46,196 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-14 03:07:46,221 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-02-14 03:07:46,222 INFO L444 ModelExtractionUtils]: 25 out of 43 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-02-14 03:07:46,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-14 03:07:46,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 03:07:46,227 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-14 03:07:46,231 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-14 03:07:46,232 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-14 03:07:46,241 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-14 03:07:46,241 INFO L513 LassoAnalysis]: Proved termination. [2023-02-14 03:07:46,241 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-14 03:07:46,247 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-14 03:07:46,303 INFO L156 tatePredicateManager]: 18 out of 20 supporting invariants were superfluous and have been removed [2023-02-14 03:07:46,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:46,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 03:07:46,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:46,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 03:07:46,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:46,460 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-14 03:07:46,460 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-14 03:07:46,461 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-14 03:07:46,468 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-14 03:07:46,522 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-14 03:07:46,524 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-14 03:07:46,524 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-14 03:07:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2023-02-14 03:07:46,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-14 03:07:46,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:46,525 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:07:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:46,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 03:07:46,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:46,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 03:07:46,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:46,658 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-14 03:07:46,659 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-14 03:07:46,659 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-14 03:07:46,711 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-14 03:07:46,713 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-14 03:07:46,714 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-14 03:07:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2023-02-14 03:07:46,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-14 03:07:46,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:46,714 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-14 03:07:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 03:07:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:46,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 03:07:46,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 03:07:46,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 03:07:46,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 03:07:46,860 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-14 03:07:46,860 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-14 03:07:46,861 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-14 03:07:46,916 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-14 03:07:46,917 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-14 03:07:46,917 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-14 03:07:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2023-02-14 03:07:46,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-14 03:07:46,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:46,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 21 letters. Loop has 3 letters. [2023-02-14 03:07:46,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:46,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 6 letters. [2023-02-14 03:07:46,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-14 03:07:46,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 102 transitions. [2023-02-14 03:07:46,920 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-14 03:07:46,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2023-02-14 03:07:46,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-14 03:07:46,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-14 03:07:46,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-14 03:07:46,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-14 03:07:46,921 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-14 03:07:46,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-14 03:07:46,921 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-14 03:07:46,921 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-14 03:07:46,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-14 03:07:46,921 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-14 03:07:46,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-14 03:07:46,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.02 03:07:46 BoogieIcfgContainer [2023-02-14 03:07:46,927 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-14 03:07:46,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 03:07:46,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 03:07:46,928 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 03:07:46,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 03:07:34" (3/4) ... [2023-02-14 03:07:46,931 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 03:07:46,931 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 03:07:46,932 INFO L158 Benchmark]: Toolchain (without parser) took 12539.68ms. Allocated memory was 132.1MB in the beginning and 197.1MB in the end (delta: 65.0MB). Free memory was 89.3MB in the beginning and 116.1MB in the end (delta: -26.8MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2023-02-14 03:07:46,932 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 132.1MB. Free memory was 101.3MB in the beginning and 101.2MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 03:07:46,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.53ms. Allocated memory is still 132.1MB. Free memory was 89.3MB in the beginning and 79.2MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 03:07:46,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.80ms. Allocated memory is still 132.1MB. Free memory was 79.2MB in the beginning and 77.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 03:07:46,933 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 132.1MB. Free memory was 77.4MB in the beginning and 76.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 03:07:46,934 INFO L158 Benchmark]: RCFGBuilder took 278.77ms. Allocated memory is still 132.1MB. Free memory was 76.2MB in the beginning and 64.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 03:07:46,936 INFO L158 Benchmark]: BuchiAutomizer took 12003.23ms. Allocated memory was 132.1MB in the beginning and 197.1MB in the end (delta: 65.0MB). Free memory was 64.1MB in the beginning and 117.2MB in the end (delta: -53.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2023-02-14 03:07:46,936 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 197.1MB. Free memory was 117.2MB in the beginning and 116.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 03:07:46,937 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 132.1MB. Free memory was 101.3MB in the beginning and 101.2MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.53ms. Allocated memory is still 132.1MB. Free memory was 89.3MB in the beginning and 79.2MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.80ms. Allocated memory is still 132.1MB. Free memory was 79.2MB in the beginning and 77.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 132.1MB. Free memory was 77.4MB in the beginning and 76.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.77ms. Allocated memory is still 132.1MB. Free memory was 76.2MB in the beginning and 64.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 12003.23ms. Allocated memory was 132.1MB in the beginning and 197.1MB in the end (delta: 65.0MB). Free memory was 64.1MB in the beginning and 117.2MB in the end (delta: -53.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 197.1MB. Free memory was 117.2MB in the beginning and 116.1MB 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 11.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 10.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. 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.2s 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 hnf93 smp71 dnf589 smp50 tf100 neg95 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 169ms 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-14 03:07:46,955 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