./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrspn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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/cstrspn.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 ecf20dd2c3ee96f4ce33fb05fe8b8a847f94671834911abc2dee98681c717cc6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:16:57,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:16:57,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:16:57,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:16:57,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:16:57,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:16:57,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:16:57,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:16:57,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:16:57,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:16:57,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:16:57,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:16:57,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:16:57,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:16:57,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:16:57,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:16:57,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:16:57,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:16:57,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:16:57,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:16:57,629 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:16:57,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:16:57,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:16:57,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:16:57,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:16:57,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:16:57,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:16:57,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:16:57,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:16:57,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:16:57,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:16:57,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:16:57,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:16:57,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:16:57,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:16:57,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:16:57,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:16:57,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:16:57,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:16:57,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:16:57,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:16:57,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:16:57,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-23 14:16:57,659 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:16:57,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:16:57,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:16:57,660 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:16:57,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:16:57,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:16:57,661 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:16:57,661 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:16:57,661 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:16:57,661 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:16:57,662 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:16:57,662 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:16:57,662 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:16:57,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:16:57,662 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:16:57,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:16:57,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:16:57,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:16:57,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:16:57,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:16:57,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:16:57,664 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:16:57,664 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:16:57,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:16:57,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:16:57,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:16:57,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:16:57,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:16:57,665 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:16:57,665 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 -> ecf20dd2c3ee96f4ce33fb05fe8b8a847f94671834911abc2dee98681c717cc6 [2022-07-23 14:16:57,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:16:57,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:16:57,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:16:57,820 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:16:57,820 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:16:57,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2022-07-23 14:16:57,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e1097dd/7a6366c7330f48d881780b1ab2f6104e/FLAGc8d3bb910 [2022-07-23 14:16:58,189 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:16:58,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2022-07-23 14:16:58,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e1097dd/7a6366c7330f48d881780b1ab2f6104e/FLAGc8d3bb910 [2022-07-23 14:16:58,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e1097dd/7a6366c7330f48d881780b1ab2f6104e [2022-07-23 14:16:58,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:16:58,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:16:58,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:16:58,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:16:58,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:16:58,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c2159b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58, skipping insertion in model container [2022-07-23 14:16:58,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:16:58,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:16:58,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:16:58,803 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:16:58,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:16:58,826 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:16:58,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58 WrapperNode [2022-07-23 14:16:58,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:16:58,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:16:58,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:16:58,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:16:58,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,852 INFO L137 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2022-07-23 14:16:58,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:16:58,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:16:58,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:16:58,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:16:58,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:16:58,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:16:58,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:16:58,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:16:58,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (1/1) ... [2022-07-23 14:16:58,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:16:58,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:16:58,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:16:58,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 14:16:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:16:58,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 14:16:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:16:58,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:16:58,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:16:59,005 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:16:59,006 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:16:59,144 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:16:59,148 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:16:59,152 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 14:16:59,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:16:59 BoogieIcfgContainer [2022-07-23 14:16:59,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:16:59,154 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:16:59,154 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:16:59,156 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:16:59,167 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:16:59,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:16:58" (1/3) ... [2022-07-23 14:16:59,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43ea765c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:16:59, skipping insertion in model container [2022-07-23 14:16:59,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:16:59,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:16:58" (2/3) ... [2022-07-23 14:16:59,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@43ea765c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:16:59, skipping insertion in model container [2022-07-23 14:16:59,169 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:16:59,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:16:59" (3/3) ... [2022-07-23 14:16:59,170 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrspn.c [2022-07-23 14:16:59,217 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:16:59,218 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:16:59,218 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:16:59,220 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:16:59,221 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:16:59,221 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:16:59,221 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:16:59,221 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:16:59,228 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) [2022-07-23 14:16:59,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 14:16:59,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:16:59,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:16:59,252 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:16:59,252 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:16:59,252 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:16:59,253 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) [2022-07-23 14:16:59,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 14:16:59,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:16:59,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:16:59,256 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:16:59,256 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:16:59,262 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#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;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#L14true assume !(build_nondet_String_~length~0#1 < 1); 18#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);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; 17#L19true 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; 10#L14-3true assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 14#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);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; 6#L19-1true 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 15#L31-4true [2022-07-23 14:16:59,262 INFO L754 eck$LassoCheckResult]: Loop: 15#L31-4true call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 16#L31-1true assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 12#L34-5true assume !true; 4#L34-6true call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 8#L36true assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 11#L31-3true cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 15#L31-4true [2022-07-23 14:16:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:16:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2022-07-23 14:16:59,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:16:59,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130737452] [2022-07-23 14:16:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:16:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:16:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:16:59,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:16:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:16:59,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:16:59,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:16:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2022-07-23 14:16:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:16:59,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828133104] [2022-07-23 14:16:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:16:59,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:16:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:16:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:16:59,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:16:59,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828133104] [2022-07-23 14:16:59,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828133104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:16:59,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:16:59,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 14:16:59,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171697573] [2022-07-23 14:16:59,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:16:59,476 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:16:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:16:59,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 14:16:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 14:16:59,501 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) [2022-07-23 14:16:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:16:59,505 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-07-23 14:16:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 14:16:59,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2022-07-23 14:16:59,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 14:16:59,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2022-07-23 14:16:59,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-23 14:16:59,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-23 14:16:59,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2022-07-23 14:16:59,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:16:59,513 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-23 14:16:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2022-07-23 14:16:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-23 14:16:59,528 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) [2022-07-23 14:16:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-07-23 14:16:59,529 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-23 14:16:59,529 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-23 14:16:59,530 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:16:59,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2022-07-23 14:16:59,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-23 14:16:59,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:16:59,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:16:59,531 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:16:59,531 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:16:59,531 INFO L752 eck$LassoCheckResult]: Stem: 50#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 51#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;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; 57#L14 assume !(build_nondet_String_~length~0#1 < 1); 58#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);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; 65#L19 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; 59#L14-3 assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 60#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);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; 54#L19-1 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 55#L31-4 [2022-07-23 14:16:59,532 INFO L754 eck$LassoCheckResult]: Loop: 55#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 64#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 61#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 62#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 63#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 52#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 53#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 56#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 55#L31-4 [2022-07-23 14:16:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:16:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2022-07-23 14:16:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:16:59,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255881606] [2022-07-23 14:16:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:16:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:16:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:16:59,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:16:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:16:59,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:16:59,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:16:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2022-07-23 14:16:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:16:59,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908362584] [2022-07-23 14:16:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:16:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:16:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:16:59,596 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:16:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:16:59,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:16:59,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:16:59,605 INFO L85 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2022-07-23 14:16:59,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:16:59,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415111650] [2022-07-23 14:16:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:16:59,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:16:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:16:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:16:59,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:16:59,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415111650] [2022-07-23 14:16:59,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415111650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:16:59,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:16:59,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 14:16:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883635659] [2022-07-23 14:16:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:16:59,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:16:59,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 14:16:59,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:16:59,947 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) [2022-07-23 14:17:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:17:00,076 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-07-23 14:17:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:17:00,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2022-07-23 14:17:00,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-07-23 14:17:00,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 38 transitions. [2022-07-23 14:17:00,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-23 14:17:00,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-23 14:17:00,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2022-07-23 14:17:00,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:17:00,083 INFO L369 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-23 14:17:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2022-07-23 14:17:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-23 14:17:00,088 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) [2022-07-23 14:17:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-23 14:17:00,089 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-23 14:17:00,089 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-23 14:17:00,089 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:17:00,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2022-07-23 14:17:00,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-07-23 14:17:00,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:17:00,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:17:00,094 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:17:00,094 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:17:00,095 INFO L752 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 124#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;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; 129#L14 assume !(build_nondet_String_~length~0#1 < 1); 131#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);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; 142#L19 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; 132#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 133#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);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; 127#L19-1 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 128#L31-4 [2022-07-23 14:17:00,095 INFO L754 eck$LassoCheckResult]: Loop: 128#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 140#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 146#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 151#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 150#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 149#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 148#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 135#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 128#L31-4 [2022-07-23 14:17:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2022-07-23 14:17:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:00,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971155739] [2022-07-23 14:17:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:00,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:00,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:00,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2022-07-23 14:17:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:00,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045825429] [2022-07-23 14:17:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:00,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:00,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2022-07-23 14:17:00,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:00,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308321005] [2022-07-23 14:17:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:00,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:00,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:00,782 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:17:00,783 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:17:00,783 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:17:00,783 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:17:00,784 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:17:00,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:00,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:17:00,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:17:00,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration3_Lasso [2022-07-23 14:17:00,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:17:00,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:17:00,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:00,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:01,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:01,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:01,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:01,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:01,713 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:17:01,719 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:17:01,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:01,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:01,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:01,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 14:17:01,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:01,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:01,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:01,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:01,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:01,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:01,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:01,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:01,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:01,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-23 14:17:01,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:01,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:01,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:01,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 14:17:01,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:01,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:01,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:01,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:01,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:01,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:01,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:01,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:01,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:01,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:01,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:01,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:01,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 14:17:01,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:01,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:01,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:01,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:01,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:01,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:01,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:01,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:01,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:01,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:01,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:01,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:01,888 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:01,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 14:17:01,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:01,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:01,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:01,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:01,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:01,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:01,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:01,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:01,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:01,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:01,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:01,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:01,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:01,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 14:17:01,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:01,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:01,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:01,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:01,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:01,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:01,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:01,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:01,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:01,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:01,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:01,967 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:01,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 14:17:01,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:01,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:01,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:01,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:01,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:01,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:01,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:01,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:01,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:01,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:01,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:01,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:01,996 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:01,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 14:17:01,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:02,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:02,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-23 14:17:02,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,034 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 14:17:02,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:02,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:02,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:02,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:02,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,059 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 14:17:02,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:02,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:02,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:02,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-23 14:17:02,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,097 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 14:17:02,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:02,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:02,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:02,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:02,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,147 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 14:17:02,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 [2022-07-23 14:17:02,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:02,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:02,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:02,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:02,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,187 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 14:17:02,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:02,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:02,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:02,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:02,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,225 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 14:17:02,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:02,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:02,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:02,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-23 14:17:02,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,261 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 14:17:02,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:02,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:02,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:02,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:02,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,300 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 14:17:02,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:02,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:02,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:02,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,345 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 14:17:02,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:02,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,353 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:17:02,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,356 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:17:02,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:02,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:02,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,386 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 14:17:02,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:02,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:02,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:02,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:02,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-23 14:17:02,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,410 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 14:17:02,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:02,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:02,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:02,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:02,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:02,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:02,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:02,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:17:02,449 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-23 14:17:02,449 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-23 14:17:02,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:02,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:02,453 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:02,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 14:17:02,512 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:17:02,541 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:17:02,541 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:17:02,541 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1 Supporting invariants [] [2022-07-23 14:17:02,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:02,588 INFO L293 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-07-23 14:17:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:02,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 14:17:02,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:02,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:17:02,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:17:02,717 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:17:02,717 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) [2022-07-23 14:17:02,752 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. [2022-07-23 14:17:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-23 14:17:02,753 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) [2022-07-23 14:17:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-07-23 14:17:02,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2022-07-23 14:17:02,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:02,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2022-07-23 14:17:02,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:02,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2022-07-23 14:17:02,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:02,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2022-07-23 14:17:02,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-23 14:17:02,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 56 transitions. [2022-07-23 14:17:02,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-23 14:17:02,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-23 14:17:02,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2022-07-23 14:17:02,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:17:02,758 INFO L369 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2022-07-23 14:17:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2022-07-23 14:17:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2022-07-23 14:17:02,760 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) [2022-07-23 14:17:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-07-23 14:17:02,760 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-07-23 14:17:02,760 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-07-23 14:17:02,760 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:17:02,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2022-07-23 14:17:02,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:17:02,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:17:02,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:17:02,762 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:17:02,762 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:17:02,762 INFO L752 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 298#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;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; 305#L14 assume !(build_nondet_String_~length~0#1 < 1); 306#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);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; 323#L19 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; 308#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 309#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);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; 318#L19-1 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 330#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 320#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 311#L34-5 [2022-07-23 14:17:02,762 INFO L754 eck$LassoCheckResult]: Loop: 311#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 312#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 315#L34-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 311#L34-5 [2022-07-23 14:17:02,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2022-07-23 14:17:02,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:02,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764119679] [2022-07-23 14:17:02,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:02,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:02,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:02,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2022-07-23 14:17:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:02,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52763444] [2022-07-23 14:17:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:02,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:02,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:02,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2022-07-23 14:17:02,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:02,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475765858] [2022-07-23 14:17:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:02,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:02,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:03,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:03,410 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:17:03,410 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:17:03,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:17:03,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:17:03,410 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:17:03,410 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:03,410 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:17:03,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:17:03,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration4_Lasso [2022-07-23 14:17:03,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:17:03,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:17:03,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:03,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:04,383 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:17:04,383 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:17:04,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,384 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:04,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:04,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:04,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 14:17:04,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:04,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,425 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-23 14:17:04,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:04,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:04,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:04,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:04,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,475 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-23 14:17:04,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:04,484 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:04,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-23 14:17:04,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,507 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-23 14:17:04,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:04,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:04,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:04,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-23 14:17:04,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,531 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-23 14:17:04,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 [2022-07-23 14:17:04,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:04,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:04,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:04,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:04,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,556 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-23 14:17:04,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:04,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:04,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:04,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-23 14:17:04,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,579 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-23 14:17:04,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:04,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:04,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:04,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:04,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,604 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-23 14:17:04,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:04,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:04,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:04,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-23 14:17:04,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,638 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-23 14:17:04,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:04,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:04,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-23 14:17:04,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,675 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-23 14:17:04,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:04,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:04,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-23 14:17:04,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,712 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-23 14:17:04,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:04,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:04,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:04,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,769 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-23 14:17:04,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:04,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:04,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-23 14:17:04,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,804 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-23 14:17:04,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,822 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-23 14:17:04,822 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-07-23 14:17:04,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,865 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2022-07-23 14:17:04,865 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-07-23 14:17:04,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:04,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:04,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:04,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:04,950 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:04,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-23 14:17:04,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:04,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:04,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:04,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:04,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:04,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:04,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:04,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:17:05,023 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2022-07-23 14:17:05,023 INFO L444 ModelExtractionUtils]: 12 out of 49 variables were initially zero. Simplification set additionally 34 variables to zero. [2022-07-23 14:17:05,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:05,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:05,024 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:05,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-23 14:17:05,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:17:05,032 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:17:05,032 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:17:05,032 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2, ULTIMATE.start_cstrspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0#1.offset Supporting invariants [] [2022-07-23 14:17:05,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:05,073 INFO L293 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2022-07-23 14:17:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:05,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 14:17:05,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:05,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:17:05,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:17:05,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-23 14:17:05,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2022-07-23 14:17:05,209 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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 7 states. [2022-07-23 14:17:05,210 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 [2022-07-23 14:17:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2022-07-23 14:17:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-07-23 14:17:05,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 3 letters. [2022-07-23 14:17:05,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:05,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 3 letters. [2022-07-23 14:17:05,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:05,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-23 14:17:05,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:05,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2022-07-23 14:17:05,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:17:05,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 61 states and 80 transitions. [2022-07-23 14:17:05,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 14:17:05,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 14:17:05,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 80 transitions. [2022-07-23 14:17:05,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:17:05,213 INFO L369 hiAutomatonCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-07-23 14:17:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 80 transitions. [2022-07-23 14:17:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-07-23 14:17:05,215 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) [2022-07-23 14:17:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-07-23 14:17:05,216 INFO L392 hiAutomatonCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-07-23 14:17:05,216 INFO L374 stractBuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-07-23 14:17:05,216 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:17:05,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2022-07-23 14:17:05,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:17:05,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:17:05,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:17:05,217 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:17:05,217 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:17:05,218 INFO L752 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 522#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;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; 528#L14 assume !(build_nondet_String_~length~0#1 < 1); 529#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);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; 546#L19 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; 531#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 532#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);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; 540#L19-1 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 559#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 557#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 558#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 551#L34-1 assume !cstrspn_#t~short7#1; 552#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 565#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 564#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 563#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 562#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 542#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 534#L34-5 [2022-07-23 14:17:05,218 INFO L754 eck$LassoCheckResult]: Loop: 534#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 535#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 538#L34-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 534#L34-5 [2022-07-23 14:17:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2022-07-23 14:17:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:05,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011254918] [2022-07-23 14:17:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:17:05,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:17:05,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011254918] [2022-07-23 14:17:05,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011254918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:17:05,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:17:05,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 14:17:05,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744661558] [2022-07-23 14:17:05,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:17:05,258 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:17:05,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:05,258 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2022-07-23 14:17:05,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:05,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191318432] [2022-07-23 14:17:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:05,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:05,262 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:05,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:05,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:17:05,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:17:05,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:17:05,343 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) [2022-07-23 14:17:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:17:05,386 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-07-23 14:17:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:17:05,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2022-07-23 14:17:05,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:17:05,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 54 states and 68 transitions. [2022-07-23 14:17:05,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 14:17:05,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 14:17:05,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 68 transitions. [2022-07-23 14:17:05,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:17:05,388 INFO L369 hiAutomatonCegarLoop]: Abstraction has 54 states and 68 transitions. [2022-07-23 14:17:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 68 transitions. [2022-07-23 14:17:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-07-23 14:17:05,391 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) [2022-07-23 14:17:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-07-23 14:17:05,391 INFO L392 hiAutomatonCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-07-23 14:17:05,391 INFO L374 stractBuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-07-23 14:17:05,391 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:17:05,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2022-07-23 14:17:05,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-23 14:17:05,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:17:05,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:17:05,392 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:17:05,392 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:17:05,392 INFO L752 eck$LassoCheckResult]: Stem: 647#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 648#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;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; 653#L14 assume !(build_nondet_String_~length~0#1 < 1); 655#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);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; 674#L19 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; 656#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 657#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);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; 651#L19-1 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_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 652#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 683#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 680#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 682#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 676#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 649#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 650#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 654#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 659#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 670#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 660#L34-5 [2022-07-23 14:17:05,393 INFO L754 eck$LassoCheckResult]: Loop: 660#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 661#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 664#L34-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 660#L34-5 [2022-07-23 14:17:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2022-07-23 14:17:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:05,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851523691] [2022-07-23 14:17:05,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:05,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:05,405 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:05,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:05,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:05,417 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2022-07-23 14:17:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:05,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766162327] [2022-07-23 14:17:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:05,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:05,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:05,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:05,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:05,430 INFO L85 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2022-07-23 14:17:05,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:17:05,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451279104] [2022-07-23 14:17:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:17:05,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:17:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:05,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:17:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:17:05,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:17:05,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:06,382 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:17:06,382 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:17:06,382 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:17:06,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:17:06,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:17:06,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:06,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:17:06,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:17:06,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration6_Lasso [2022-07-23 14:17:06,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:17:06,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:17:06,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:06,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:17:07,743 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:17:07,743 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:17:07,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:07,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:07,744 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:07,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-23 14:17:07,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:07,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:07,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:07,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:07,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:07,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:07,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:07,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:07,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:07,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:07,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:07,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:07,771 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:07,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:07,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:07,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:07,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:07,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:07,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:07,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:07,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-23 14:17:07,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:07,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:07,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:07,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:07,833 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:07,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-23 14:17:07,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:07,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:07,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:07,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:07,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:07,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:07,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:07,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:07,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:07,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-23 14:17:07,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:07,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:07,870 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:07,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-23 14:17:07,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:07,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:07,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:17:07,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:07,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:07,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:07,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:17:07,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:17:07,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:07,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-23 14:17:07,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:07,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:07,903 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:07,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-23 14:17:07,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:07,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:07,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:07,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:07,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:07,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:07,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:07,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:17:07,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-23 14:17:07,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:07,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:07,930 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:07,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-23 14:17:07,933 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:17:07,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:17:07,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:17:07,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:17:07,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:17:07,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:17:07,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:17:07,959 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:17:07,977 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-23 14:17:07,977 INFO L444 ModelExtractionUtils]: 29 out of 49 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-07-23 14:17:07,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:17:07,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:17:07,978 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:17:07,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-23 14:17:07,980 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:17:07,987 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:17:07,987 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:17:07,987 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3 Supporting invariants [] [2022-07-23 14:17:08,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-23 14:17:08,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-23 14:17:08,049 INFO L293 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2022-07-23 14:17:08,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:08,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 14:17:08,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:08,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 14:17:08,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:17:08,169 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-23 14:17:08,169 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) [2022-07-23 14:17:08,211 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. [2022-07-23 14:17:08,211 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 [2022-07-23 14:17:08,211 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) [2022-07-23 14:17:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-07-23 14:17:08,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-23 14:17:08,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:08,212 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:17:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:08,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 14:17:08,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:08,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 14:17:08,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:17:08,311 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-23 14:17:08,311 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) [2022-07-23 14:17:08,349 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. [2022-07-23 14:17:08,350 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 [2022-07-23 14:17:08,351 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) [2022-07-23 14:17:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-07-23 14:17:08,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-23 14:17:08,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:08,351 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:17:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:17:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:08,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 14:17:08,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:17:08,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 14:17:08,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:17:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:17:08,472 INFO L152 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 [2022-07-23 14:17:08,472 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) [2022-07-23 14:17:08,518 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. [2022-07-23 14:17:08,518 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 [2022-07-23 14:17:08,518 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) [2022-07-23 14:17:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-07-23 14:17:08,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-23 14:17:08,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:08,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 21 letters. Loop has 3 letters. [2022-07-23 14:17:08,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:08,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 6 letters. [2022-07-23 14:17:08,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:17:08,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 102 transitions. [2022-07-23 14:17:08,521 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:17:08,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2022-07-23 14:17:08,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 14:17:08,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 14:17:08,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 14:17:08,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:17:08,521 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:17:08,521 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:17:08,522 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:17:08,522 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:17:08,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 14:17:08,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:17:08,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 14:17:08,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 02:17:08 BoogieIcfgContainer [2022-07-23 14:17:08,531 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 14:17:08,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 14:17:08,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 14:17:08,532 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 14:17:08,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:16:59" (3/4) ... [2022-07-23 14:17:08,533 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 14:17:08,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 14:17:08,534 INFO L158 Benchmark]: Toolchain (without parser) took 9884.26ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 74.9MB in the beginning and 65.5MB in the end (delta: 9.4MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2022-07-23 14:17:08,534 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory was 59.2MB in the beginning and 59.2MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:17:08,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.80ms. Allocated memory is still 102.8MB. Free memory was 74.9MB in the beginning and 79.3MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 14:17:08,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 102.8MB. Free memory was 79.3MB in the beginning and 77.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:17:08,535 INFO L158 Benchmark]: Boogie Preprocessor took 26.25ms. Allocated memory is still 102.8MB. Free memory was 77.5MB in the beginning and 76.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:17:08,536 INFO L158 Benchmark]: RCFGBuilder took 273.60ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 64.7MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 14:17:08,536 INFO L158 Benchmark]: BuchiAutomizer took 9377.23ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 64.4MB in the beginning and 65.5MB in the end (delta: -1.1MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2022-07-23 14:17:08,536 INFO L158 Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 151.0MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:17:08,537 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.16ms. Allocated memory is still 102.8MB. Free memory was 59.2MB in the beginning and 59.2MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.80ms. Allocated memory is still 102.8MB. Free memory was 74.9MB in the beginning and 79.3MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 102.8MB. Free memory was 79.3MB in the beginning and 77.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.25ms. Allocated memory is still 102.8MB. Free memory was 77.5MB in the beginning and 76.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 273.60ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 64.7MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 9377.23ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 64.4MB in the beginning and 65.5MB in the end (delta: -1.1MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Witness Printer took 2.33ms. Allocated memory is still 151.0MB. Free memory is still 65.5MB. 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 unknown-#length-unknown[nondetString] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString] + -1 * s and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 8.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. 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, 163 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 140 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital276 mio100 ax100 hnf100 lsp103 ukn73 mio100 lsp34 div129 bol100 ite100 ukn100 eq169 hnf93 smp84 dnf562 smp50 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 129ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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! [2022-07-23 14:17:08,563 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