./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 f4b24e32 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-?-f4b24e3 [2022-07-14 14:49:09,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:49:09,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:49:09,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:49:09,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:49:09,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:49:09,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:49:09,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:49:09,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:49:09,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:49:09,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:49:09,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:49:09,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:49:09,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:49:09,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:49:09,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:49:09,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:49:09,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:49:09,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:49:09,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:49:09,226 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:49:09,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:49:09,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:49:09,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:49:09,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:49:09,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:49:09,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:49:09,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:49:09,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:49:09,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:49:09,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:49:09,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:49:09,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:49:09,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:49:09,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:49:09,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:49:09,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:49:09,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:49:09,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:49:09,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:49:09,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:49:09,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:49:09,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:49:09,278 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:49:09,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:49:09,279 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:49:09,280 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:49:09,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:49:09,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:49:09,281 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:49:09,282 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:49:09,282 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:49:09,283 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:49:09,283 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:49:09,283 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:49:09,283 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:49:09,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:49:09,283 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:49:09,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:49:09,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:49:09,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:49:09,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:49:09,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:49:09,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:49:09,286 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:49:09,286 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:49:09,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:49:09,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:49:09,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:49:09,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:49:09,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:49:09,288 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:49:09,288 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-14 14:49:09,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:49:09,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:49:09,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:49:09,509 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:49:09,509 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:49:09,511 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-14 14:49:09,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626671e71/1084419d535f41018c00b4d3f573816b/FLAG66cd55659 [2022-07-14 14:49:10,023 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:49:10,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2022-07-14 14:49:10,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626671e71/1084419d535f41018c00b4d3f573816b/FLAG66cd55659 [2022-07-14 14:49:10,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626671e71/1084419d535f41018c00b4d3f573816b [2022-07-14 14:49:10,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:49:10,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:49:10,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:49:10,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:49:10,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:49:10,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8aea1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10, skipping insertion in model container [2022-07-14 14:49:10,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:49:10,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:49:10,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:49:10,614 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:49:10,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:49:10,638 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:49:10,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10 WrapperNode [2022-07-14 14:49:10,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:49:10,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:49:10,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:49:10,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:49:10,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,669 INFO L137 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2022-07-14 14:49:10,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:49:10,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:49:10,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:49:10,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:49:10,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:49:10,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:49:10,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:49:10,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:49:10,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (1/1) ... [2022-07-14 14:49:10,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:10,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:10,725 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-14 14:49:10,747 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-14 14:49:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:49:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 14:49:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:49:10,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:49:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:49:10,814 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:49:10,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:49:10,987 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:49:10,993 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:49:10,994 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 14:49:10,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:49:10 BoogieIcfgContainer [2022-07-14 14:49:10,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:49:10,998 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:49:10,999 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:49:11,002 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:49:11,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:49:11,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:49:10" (1/3) ... [2022-07-14 14:49:11,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e95c5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:49:11, skipping insertion in model container [2022-07-14 14:49:11,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:49:11,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:49:10" (2/3) ... [2022-07-14 14:49:11,006 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e95c5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:49:11, skipping insertion in model container [2022-07-14 14:49:11,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:49:11,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:49:10" (3/3) ... [2022-07-14 14:49:11,008 INFO L354 chiAutomizerObserver]: Analyzing ICFG cstrspn.c [2022-07-14 14:49:11,108 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:49:11,109 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:49:11,109 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:49:11,109 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:49:11,109 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:49:11,109 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:49:11,109 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:49:11,110 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:49:11,115 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-14 14:49:11,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:49:11,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:49:11,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:49:11,147 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:11,147 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:49:11,148 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:49:11,148 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-14 14:49:11,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:49:11,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:49:11,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:49:11,152 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:11,152 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:49:11,159 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-14 14:49:11,160 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-14 14:49:11,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2022-07-14 14:49:11,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:11,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641632450] [2022-07-14 14:49:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:11,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:11,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2022-07-14 14:49:11,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:11,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167722620] [2022-07-14 14:49:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:11,441 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-14 14:49:11,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:49:11,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167722620] [2022-07-14 14:49:11,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167722620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:49:11,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:49:11,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:49:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920664990] [2022-07-14 14:49:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:49:11,448 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:49:11,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:49:11,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 14:49:11,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 14:49:11,480 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-14 14:49:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:49:11,488 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-07-14 14:49:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 14:49:11,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2022-07-14 14:49:11,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:49:11,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2022-07-14 14:49:11,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-14 14:49:11,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-14 14:49:11,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2022-07-14 14:49:11,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:49:11,502 INFO L369 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-14 14:49:11,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2022-07-14 14:49:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-14 14:49:11,522 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-14 14:49:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-07-14 14:49:11,523 INFO L392 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-14 14:49:11,524 INFO L374 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-07-14 14:49:11,524 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:49:11,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2022-07-14 14:49:11,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:49:11,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:49:11,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:49:11,528 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:11,529 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:11,529 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-14 14:49:11,529 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-14 14:49:11,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:11,530 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2022-07-14 14:49:11,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:11,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008659794] [2022-07-14 14:49:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:11,548 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:11,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2022-07-14 14:49:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:11,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644717291] [2022-07-14 14:49:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:11,601 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:11,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2022-07-14 14:49:11,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:11,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35169581] [2022-07-14 14:49:11,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:11,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:11,721 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-14 14:49:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:49:11,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35169581] [2022-07-14 14:49:11,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35169581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:49:11,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:49:11,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 14:49:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80238339] [2022-07-14 14:49:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:49:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:49:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:49:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:49:11,998 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-14 14:49:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:49:12,126 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-07-14 14:49:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 14:49:12,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2022-07-14 14:49:12,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-07-14 14:49:12,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 38 transitions. [2022-07-14 14:49:12,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-14 14:49:12,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-14 14:49:12,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2022-07-14 14:49:12,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:49:12,130 INFO L369 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-07-14 14:49:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2022-07-14 14:49:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-14 14:49:12,132 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-14 14:49:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-14 14:49:12,133 INFO L392 hiAutomatonCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-14 14:49:12,133 INFO L374 stractBuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-14 14:49:12,133 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:49:12,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2022-07-14 14:49:12,134 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-07-14 14:49:12,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:49:12,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:49:12,135 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:12,135 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:12,135 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-14 14:49:12,135 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-14 14:49:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2022-07-14 14:49:12,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:12,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293075883] [2022-07-14 14:49:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:12,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:12,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2022-07-14 14:49:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:12,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715242868] [2022-07-14 14:49:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:12,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:12,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:12,229 INFO L85 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2022-07-14 14:49:12,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:12,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210392017] [2022-07-14 14:49:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:12,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:12,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:13,041 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:49:13,042 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:49:13,042 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:49:13,042 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:49:13,042 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:49:13,043 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:13,043 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:49:13,043 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:49:13,043 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration3_Lasso [2022-07-14 14:49:13,043 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:49:13,043 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:49:13,076 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-14 14:49:13,080 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-14 14:49:13,084 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-14 14:49:13,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:13,090 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-14 14:49:13,092 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-14 14:49:13,094 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-14 14:49:13,099 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-14 14:49:13,101 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-14 14:49:13,103 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-14 14:49:13,105 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-14 14:49:13,107 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-14 14:49:13,109 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-14 14:49:13,112 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-14 14:49:13,114 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-14 14:49:13,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:13,518 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-14 14:49:13,520 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-14 14:49:13,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:14,141 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:49:14,145 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:49:14,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,156 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-14 14:49:14,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,167 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-14 14:49:14,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,199 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-14 14:49:14,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,200 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-14 14:49:14,201 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-14 14:49:14,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:14,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:14,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,244 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-14 14:49:14,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,246 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-14 14:49:14,248 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-14 14:49:14,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,274 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-14 14:49:14,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,276 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-14 14:49:14,277 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-14 14:49:14,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:14,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,300 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-14 14:49:14,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,302 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-14 14:49:14,304 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-14 14:49:14,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,326 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-14 14:49:14,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,328 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-14 14:49:14,329 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-14 14:49:14,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,335 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,353 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-14 14:49:14,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,354 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-14 14:49:14,355 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-14 14:49:14,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:14,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:14,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,417 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-14 14:49:14,418 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-14 14:49:14,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,440 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-14 14:49:14,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,442 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-14 14:49:14,444 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-14 14:49:14,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:14,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,468 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-14 14:49:14,471 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-14 14:49:14,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:14,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,499 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-14 14:49:14,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,501 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-14 14:49:14,501 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-14 14:49:14,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,535 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-14 14:49:14,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,537 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-14 14:49:14,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,558 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-14 14:49:14,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,591 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-14 14:49:14,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,593 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-14 14:49:14,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,608 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-14 14:49:14,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:14,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,639 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-14 14:49:14,640 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-14 14:49:14,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,664 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-14 14:49:14,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,665 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-14 14:49:14,666 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-14 14:49:14,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:14,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:14,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,724 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-14 14:49:14,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,726 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-14 14:49:14,727 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-14 14:49:14,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:14,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,734 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:49:14,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,737 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 14:49:14,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-14 14:49:14,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,758 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-14 14:49:14,759 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-14 14:49:14,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:14,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:14,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:14,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:14,768 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:14,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:14,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,786 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-14 14:49:14,786 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-14 14:49:14,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:14,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:14,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:14,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:14,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:14,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:14,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:14,827 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:49:14,867 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-14 14:49:14,867 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-14 14:49:14,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:14,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:14,887 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-14 14:49:14,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:49:14,911 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-14 14:49:14,932 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:49:14,932 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:49:14,932 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1, ULTIMATE.start_cstrspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0#1.offset Supporting invariants [] [2022-07-14 14:49:14,957 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-14 14:49:14,971 INFO L293 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2022-07-14 14:49:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:15,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:49:15,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:15,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:49:15,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:15,131 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-14 14:49:15,134 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-14 14:49:15,134 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-14 14:49:15,186 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-14 14:49:15,187 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-14 14:49:15,189 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-14 14:49:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-07-14 14:49:15,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2022-07-14 14:49:15,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:15,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2022-07-14 14:49:15,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:15,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2022-07-14 14:49:15,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:15,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2022-07-14 14:49:15,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-14 14:49:15,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 56 transitions. [2022-07-14 14:49:15,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-14 14:49:15,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-07-14 14:49:15,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2022-07-14 14:49:15,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:49:15,195 INFO L369 hiAutomatonCegarLoop]: Abstraction has 42 states and 56 transitions. [2022-07-14 14:49:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2022-07-14 14:49:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2022-07-14 14:49:15,198 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-14 14:49:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-07-14 14:49:15,199 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-07-14 14:49:15,199 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-07-14 14:49:15,199 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:49:15,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2022-07-14 14:49:15,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:49:15,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:49:15,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:49:15,202 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:15,202 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:49:15,202 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-14 14:49:15,203 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-14 14:49:15,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2022-07-14 14:49:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:15,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223773245] [2022-07-14 14:49:15,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:15,222 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:15,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:15,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2022-07-14 14:49:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:15,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850321330] [2022-07-14 14:49:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:15,257 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:15,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2022-07-14 14:49:15,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:15,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276324553] [2022-07-14 14:49:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:15,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:15,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:15,573 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-14 14:49:16,003 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:49:16,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:49:16,003 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:49:16,003 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:49:16,003 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:49:16,003 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:16,003 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:49:16,003 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:49:16,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration4_Lasso [2022-07-14 14:49:16,004 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:49:16,004 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:49:16,006 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-14 14:49:16,013 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-14 14:49:16,015 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-14 14:49:16,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:16,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:16,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:16,023 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-14 14:49:16,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 14:49:16,026 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-14 14:49:16,430 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-14 14:49:16,433 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-14 14:49:16,435 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-14 14:49:16,436 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-14 14:49:16,438 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-14 14:49:16,440 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-14 14:49:16,441 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-14 14:49:16,443 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-14 14:49:16,446 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-14 14:49:16,447 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-14 14:49:17,237 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:49:17,237 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:49:17,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,239 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-14 14:49:17,254 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-14 14:49:17,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:17,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:17,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:17,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:17,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,300 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-14 14:49:17,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,301 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-14 14:49:17,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:17,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:17,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:17,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:17,318 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-14 14:49:17,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-14 14:49:17,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,344 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-14 14:49:17,345 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-14 14:49:17,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-14 14:49:17,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:17,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:17,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,372 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-14 14:49:17,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,373 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-14 14:49:17,374 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-14 14:49:17,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:17,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:17,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:17,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:17,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,396 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-14 14:49:17,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,398 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-14 14:49:17,399 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-14 14:49:17,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:17,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:17,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:17,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:17,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-14 14:49:17,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,422 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-14 14:49:17,423 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-14 14:49:17,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:17,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:17,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:17,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:17,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:17,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,447 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-14 14:49:17,448 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-14 14:49:17,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:17,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:17,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:17,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:17,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,470 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-14 14:49:17,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,472 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-14 14:49:17,472 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-14 14:49:17,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:17,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:17,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:17,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:17,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,496 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-14 14:49:17,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,497 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-14 14:49:17,498 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-14 14:49:17,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:17,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:17,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:17,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,547 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-14 14:49:17,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,549 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-14 14:49:17,549 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-14 14:49:17,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:17,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:17,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:17,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:17,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,611 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-14 14:49:17,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:17,625 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-14 14:49:17,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:17,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:17,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,667 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-14 14:49:17,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,668 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-14 14:49:17,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:17,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:17,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:17,684 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-14 14:49:17,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:17,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,716 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-14 14:49:17,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:17,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,727 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-14 14:49:17,727 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-07-14 14:49:17,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,754 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-14 14:49:17,790 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2022-07-14 14:49:17,790 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2022-07-14 14:49:17,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:17,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-14 14:49:17,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:17,905 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-14 14:49:17,906 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-14 14:49:17,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-14 14:49:17,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:17,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:17,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:17,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:17,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:17,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:17,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:49:18,002 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2022-07-14 14:49:18,002 INFO L444 ModelExtractionUtils]: 12 out of 49 variables were initially zero. Simplification set additionally 34 variables to zero. [2022-07-14 14:49:18,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:18,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:18,008 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-14 14:49:18,009 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-14 14:49:18,010 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:49:18,015 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:49:18,016 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:49:18,016 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)_2) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2 Supporting invariants [] [2022-07-14 14:49:18,039 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-14 14:49:18,066 INFO L293 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2022-07-14 14:49:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:18,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:49:18,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:18,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:49:18,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:18,188 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-14 14:49:18,191 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-14 14:49:18,191 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-14 14:49:18,264 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-14 14:49:18,264 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-14 14:49:18,265 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-14 14:49:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-07-14 14:49:18,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 3 letters. [2022-07-14 14:49:18,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:18,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 3 letters. [2022-07-14 14:49:18,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:18,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-14 14:49:18,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:18,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2022-07-14 14:49:18,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:49:18,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 61 states and 80 transitions. [2022-07-14 14:49:18,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 14:49:18,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 14:49:18,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 80 transitions. [2022-07-14 14:49:18,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:49:18,269 INFO L369 hiAutomatonCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-07-14 14:49:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 80 transitions. [2022-07-14 14:49:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-07-14 14:49:18,273 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-14 14:49:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-07-14 14:49:18,274 INFO L392 hiAutomatonCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-07-14 14:49:18,274 INFO L374 stractBuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-07-14 14:49:18,274 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:49:18,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2022-07-14 14:49:18,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:49:18,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:49:18,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:49:18,276 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:18,276 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:49:18,276 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-14 14:49:18,276 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-14 14:49:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:18,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2022-07-14 14:49:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:18,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648820648] [2022-07-14 14:49:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:18,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:18,319 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-14 14:49:18,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:49:18,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648820648] [2022-07-14 14:49:18,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648820648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:49:18,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:49:18,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 14:49:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117939771] [2022-07-14 14:49:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:49:18,320 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:49:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:18,321 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2022-07-14 14:49:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:18,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850479061] [2022-07-14 14:49:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:18,326 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:18,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:49:18,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 14:49:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:49:18,421 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-14 14:49:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:49:18,486 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-07-14 14:49:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 14:49:18,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2022-07-14 14:49:18,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-14 14:49:18,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 54 states and 68 transitions. [2022-07-14 14:49:18,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 14:49:18,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-14 14:49:18,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 68 transitions. [2022-07-14 14:49:18,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:49:18,496 INFO L369 hiAutomatonCegarLoop]: Abstraction has 54 states and 68 transitions. [2022-07-14 14:49:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 68 transitions. [2022-07-14 14:49:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-07-14 14:49:18,504 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-14 14:49:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-07-14 14:49:18,505 INFO L392 hiAutomatonCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-07-14 14:49:18,505 INFO L374 stractBuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-07-14 14:49:18,505 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 14:49:18,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2022-07-14 14:49:18,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-07-14 14:49:18,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:49:18,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:49:18,507 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:49:18,507 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-14 14:49:18,508 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-14 14:49:18,508 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-14 14:49:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2022-07-14 14:49:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:18,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884307134] [2022-07-14 14:49:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:18,559 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:18,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:18,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2022-07-14 14:49:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:18,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929846079] [2022-07-14 14:49:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:18,600 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:18,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2022-07-14 14:49:18,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:49:18,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440012728] [2022-07-14 14:49:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:49:18,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:49:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:18,635 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:49:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:49:18,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:49:18,941 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-14 14:49:19,646 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:49:19,646 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:49:19,646 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:49:19,646 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:49:19,646 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:49:19,646 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:19,646 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:49:19,646 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:49:19,646 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration6_Lasso [2022-07-14 14:49:19,646 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:49:19,646 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:49:19,648 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-14 14:49:19,650 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-14 14:49:19,652 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-14 14:49:19,653 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-14 14:49:19,654 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-14 14:49:20,212 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-14 14:49:20,214 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-14 14:49:20,215 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-14 14:49:20,218 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-14 14:49:20,219 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-14 14:49:20,221 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-14 14:49:20,222 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-14 14:49:20,223 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-14 14:49:20,225 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-14 14:49:20,227 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-14 14:49:20,228 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-14 14:49:20,229 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-14 14:49:20,231 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-14 14:49:20,232 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-14 14:49:21,219 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:49:21,219 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:49:21,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:21,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:21,224 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-14 14:49:21,228 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-14 14:49:21,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:49:21,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:21,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:21,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:21,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:21,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:21,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:21,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:21,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:21,252 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-14 14:49:21,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:21,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:21,253 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-14 14:49:21,254 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-14 14:49:21,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:21,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:21,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:21,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:21,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:21,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:21,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:21,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:21,298 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-14 14:49:21,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:21,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:21,299 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-14 14:49:21,300 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-14 14:49:21,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:21,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:21,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:21,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:21,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:21,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:21,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:21,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:21,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:21,322 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-14 14:49:21,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:21,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:21,324 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-14 14:49:21,325 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-14 14:49:21,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:21,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:21,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:49:21,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:21,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:21,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:21,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:49:21,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:49:21,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:21,348 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-14 14:49:21,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:21,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:21,349 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-14 14:49:21,350 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-14 14:49:21,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:21,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:21,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:21,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:21,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:21,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:21,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:21,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:49:21,375 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-14 14:49:21,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:21,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:21,377 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-14 14:49:21,377 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-14 14:49:21,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-14 14:49:21,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:49:21,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:49:21,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:49:21,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:49:21,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:49:21,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:49:21,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:49:21,431 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-14 14:49:21,431 INFO L444 ModelExtractionUtils]: 29 out of 49 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-07-14 14:49:21,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:49:21,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:49:21,433 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-14 14:49:21,433 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-14 14:49:21,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:49:21,440 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 14:49:21,440 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:49:21,440 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3, ULTIMATE.start_cstrspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0#1.offset Supporting invariants [] [2022-07-14 14:49:21,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-14 14:49:21,500 INFO L293 tatePredicateManager]: 15 out of 17 supporting invariants were superfluous and have been removed [2022-07-14 14:49:21,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:21,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:49:21,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:21,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:49:21,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:21,621 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-14 14:49:21,622 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-14 14:49:21,622 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-14 14:49:21,670 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-14 14:49:21,671 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-14 14:49:21,671 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-14 14:49:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-07-14 14:49:21,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-14 14:49:21,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:21,672 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:49:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:21,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:49:21,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:21,745 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-14 14:49:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:21,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:49:21,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:21,813 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-14 14:49:21,813 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-14 14:49:21,814 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-14 14:49:21,860 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-14 14:49:21,861 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-14 14:49:21,862 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-14 14:49:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-07-14 14:49:21,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-14 14:49:21,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:21,863 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:49:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:49:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:21,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:49:21,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:49:21,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:49:21,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:49:21,991 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-14 14:49:21,991 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-14 14:49:21,992 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-14 14:49:22,048 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-14 14:49:22,049 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-14 14:49:22,049 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-14 14:49:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-07-14 14:49:22,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 3 letters. [2022-07-14 14:49:22,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:22,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 21 letters. Loop has 3 letters. [2022-07-14 14:49:22,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:22,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 6 letters. [2022-07-14 14:49:22,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:49:22,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 102 transitions. [2022-07-14 14:49:22,052 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:49:22,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2022-07-14 14:49:22,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 14:49:22,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 14:49:22,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 14:49:22,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:49:22,053 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:49:22,053 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:49:22,053 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:49:22,054 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 14:49:22,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 14:49:22,054 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:49:22,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 14:49:22,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 02:49:22 BoogieIcfgContainer [2022-07-14 14:49:22,060 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 14:49:22,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 14:49:22,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 14:49:22,061 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 14:49:22,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:49:10" (3/4) ... [2022-07-14 14:49:22,063 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 14:49:22,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 14:49:22,064 INFO L158 Benchmark]: Toolchain (without parser) took 11630.14ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 100.1MB in the beginning and 96.3MB in the end (delta: 3.8MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-07-14 14:49:22,064 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:49:22,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.57ms. Allocated memory is still 127.9MB. Free memory was 99.8MB in the beginning and 104.7MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 14:49:22,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.60ms. Allocated memory is still 127.9MB. Free memory was 104.7MB in the beginning and 103.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:49:22,065 INFO L158 Benchmark]: Boogie Preprocessor took 22.08ms. Allocated memory is still 127.9MB. Free memory was 103.1MB in the beginning and 101.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:49:22,065 INFO L158 Benchmark]: RCFGBuilder took 303.74ms. Allocated memory is still 127.9MB. Free memory was 101.4MB in the beginning and 90.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 14:49:22,066 INFO L158 Benchmark]: BuchiAutomizer took 11062.10ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 89.8MB in the beginning and 97.4MB in the end (delta: -7.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-07-14 14:49:22,066 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 155.2MB. Free memory was 97.4MB in the beginning and 96.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:49:22,067 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.21ms. Allocated memory is still 88.1MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.57ms. Allocated memory is still 127.9MB. Free memory was 99.8MB in the beginning and 104.7MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.60ms. Allocated memory is still 127.9MB. Free memory was 104.7MB in the beginning and 103.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.08ms. Allocated memory is still 127.9MB. Free memory was 103.1MB in the beginning and 101.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 303.74ms. Allocated memory is still 127.9MB. Free memory was 101.4MB in the beginning and 90.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 11062.10ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 89.8MB in the beginning and 97.4MB in the end (delta: -7.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 155.2MB. Free memory was 97.4MB in the beginning and 96.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 10.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. 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.2s 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: 172ms 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-14 14:49:22,099 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