./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/cstrcspn.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 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 14:14:16,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 14:14:16,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 14:14:16,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 14:14:16,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 14:14:16,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 14:14:16,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 14:14:16,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 14:14:16,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 14:14:16,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 14:14:16,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 14:14:16,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 14:14:16,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 14:14:16,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 14:14:16,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 14:14:16,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 14:14:16,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 14:14:16,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 14:14:16,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 14:14:16,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 14:14:16,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 14:14:16,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 14:14:16,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 14:14:16,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 14:14:16,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 14:14:16,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 14:14:16,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 14:14:16,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 14:14:16,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 14:14:16,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 14:14:16,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 14:14:16,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 14:14:16,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 14:14:16,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 14:14:16,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 14:14:16,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 14:14:16,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 14:14:16,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 14:14:16,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 14:14:16,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 14:14:16,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 14:14:16,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 14:14:16,444 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 14:14:16,445 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 14:14:16,445 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 14:14:16,445 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 14:14:16,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 14:14:16,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 14:14:16,446 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 14:14:16,447 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 14:14:16,447 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 14:14:16,447 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 14:14:16,447 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 14:14:16,448 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 14:14:16,448 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 14:14:16,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 14:14:16,448 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 14:14:16,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 14:14:16,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 14:14:16,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 14:14:16,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 14:14:16,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 14:14:16,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 14:14:16,449 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 14:14:16,449 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 14:14:16,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 14:14:16,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 14:14:16,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 14:14:16,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 14:14:16,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 14:14:16,451 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 14:14:16,451 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 -> 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 [2023-02-15 14:14:16,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 14:14:16,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 14:14:16,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 14:14:16,656 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 14:14:16,656 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 14:14:16,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2023-02-15 14:14:17,666 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 14:14:17,809 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 14:14:17,809 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2023-02-15 14:14:17,813 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ac68ca7/467c99b9ac1f4e7cbe18407af587c82f/FLAGf63d4e078 [2023-02-15 14:14:17,824 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ac68ca7/467c99b9ac1f4e7cbe18407af587c82f [2023-02-15 14:14:17,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 14:14:17,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 14:14:17,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 14:14:17,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 14:14:17,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 14:14:17,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:17,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da794b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17, skipping insertion in model container [2023-02-15 14:14:17,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:17,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 14:14:17,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 14:14:17,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:14:17,940 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 14:14:17,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:14:17,960 INFO L208 MainTranslator]: Completed translation [2023-02-15 14:14:17,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17 WrapperNode [2023-02-15 14:14:17,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 14:14:17,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 14:14:17,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 14:14:17,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 14:14:17,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:17,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:17,992 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2023-02-15 14:14:17,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 14:14:17,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 14:14:17,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 14:14:17,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 14:14:18,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:18,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:18,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:18,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:18,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:18,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:18,029 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:18,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:18,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 14:14:18,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 14:14:18,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 14:14:18,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 14:14:18,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (1/1) ... [2023-02-15 14:14:18,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:18,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:18,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:18,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-02-15 14:14:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 14:14:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 14:14:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 14:14:18,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 14:14:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 14:14:18,172 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 14:14:18,174 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 14:14:18,373 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 14:14:18,377 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 14:14:18,381 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 14:14:18,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:18 BoogieIcfgContainer [2023-02-15 14:14:18,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 14:14:18,385 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 14:14:18,385 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 14:14:18,388 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 14:14:18,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:18,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:14:17" (1/3) ... [2023-02-15 14:14:18,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dd0fe15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:14:18, skipping insertion in model container [2023-02-15 14:14:18,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:18,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:14:17" (2/3) ... [2023-02-15 14:14:18,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dd0fe15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:14:18, skipping insertion in model container [2023-02-15 14:14:18,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:14:18,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:18" (3/3) ... [2023-02-15 14:14:18,395 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrcspn.c [2023-02-15 14:14:18,442 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 14:14:18,442 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 14:14:18,442 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 14:14:18,442 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 14:14:18,442 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 14:14:18,442 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 14:14:18,442 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 14:14:18,443 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 14:14:18,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:18,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:14:18,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:18,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:18,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:18,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-15 14:14:18,463 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 14:14:18,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:18,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:14:18,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:18,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:18,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:18,467 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2023-02-15 14:14:18,478 INFO L748 eck$LassoCheckResult]: Stem: 15#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#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; 7#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 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 2#build_nondet_String_returnLabel#1true main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 8#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 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 13#build_nondet_String_returnLabel#2true main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 19#L30-4true [2023-02-15 14:14:18,479 INFO L750 eck$LassoCheckResult]: Loop: 19#L30-4true call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 9#L30-1true assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 12#L33-5true assume !true; 11#L33-6true call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 22#L35true assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 20#L30-3true cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 19#L30-4true [2023-02-15 14:14:18,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:18,487 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2023-02-15 14:14:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:18,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133726835] [2023-02-15 14:14:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:18,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:18,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:18,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2023-02-15 14:14:18,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:18,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759737849] [2023-02-15 14:14:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:18,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:18,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759737849] [2023-02-15 14:14:18,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759737849] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:18,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:18,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:14:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221794830] [2023-02-15 14:14:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:18,732 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:14:18,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:18,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 14:14:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 14:14:18,765 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:18,773 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-02-15 14:14:18,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2023-02-15 14:14:18,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:14:18,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2023-02-15 14:14:18,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-02-15 14:14:18,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-02-15 14:14:18,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2023-02-15 14:14:18,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:18,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 14:14:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2023-02-15 14:14:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-15 14:14:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-02-15 14:14:18,799 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 14:14:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 14:14:18,803 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-02-15 14:14:18,803 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 14:14:18,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2023-02-15 14:14:18,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:14:18,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:18,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:18,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:18,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:18,806 INFO L748 eck$LassoCheckResult]: Stem: 64#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 54#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; 55#L14 assume !(build_nondet_String_~length~0#1 < 1); 56#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 50#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 51#L14-3 assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 57#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 62#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 63#L30-4 [2023-02-15 14:14:18,807 INFO L750 eck$LassoCheckResult]: Loop: 63#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 58#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 59#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 52#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 53#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 60#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 61#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 65#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 63#L30-4 [2023-02-15 14:14:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2023-02-15 14:14:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:18,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846975352] [2023-02-15 14:14:18,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:18,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:18,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:18,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2023-02-15 14:14:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:18,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290575239] [2023-02-15 14:14:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:18,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:18,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:18,897 INFO L85 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2023-02-15 14:14:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:18,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712892355] [2023-02-15 14:14:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:19,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712892355] [2023-02-15 14:14:19,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712892355] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:14:19,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:14:19,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 14:14:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101333507] [2023-02-15 14:14:19,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:14:19,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 14:14:19,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 14:14:19,394 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:19,477 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-02-15 14:14:19,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2023-02-15 14:14:19,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-15 14:14:19,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2023-02-15 14:14:19,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-02-15 14:14:19,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-02-15 14:14:19,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2023-02-15 14:14:19,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:19,479 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-02-15 14:14:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2023-02-15 14:14:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2023-02-15 14:14:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-02-15 14:14:19,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-15 14:14:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 14:14:19,483 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-15 14:14:19,483 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 14:14:19,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2023-02-15 14:14:19,483 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-02-15 14:14:19,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:19,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:19,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:19,484 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:19,484 INFO L748 eck$LassoCheckResult]: Stem: 136#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 122#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; 123#L14 assume !(build_nondet_String_~length~0#1 < 1); 124#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 118#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 119#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 125#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 135#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 142#L30-4 [2023-02-15 14:14:19,485 INFO L750 eck$LassoCheckResult]: Loop: 142#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 141#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 131#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 132#L33-1 assume !cstrcspn_#t~short7#1; 137#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 129#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 130#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 143#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 142#L30-4 [2023-02-15 14:14:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2023-02-15 14:14:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:19,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554128628] [2023-02-15 14:14:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:19,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:19,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1951138125, now seen corresponding path program 1 times [2023-02-15 14:14:19,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:19,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912430912] [2023-02-15 14:14:19,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:19,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:19,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:19,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:19,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash -252975234, now seen corresponding path program 1 times [2023-02-15 14:14:19,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:19,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491587612] [2023-02-15 14:14:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:19,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:19,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:20,148 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:20,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:20,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:20,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:20,149 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:20,149 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:20,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:20,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:20,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration3_Lasso [2023-02-15 14:14:20,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:20,149 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:20,168 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,174 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,176 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,178 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,180 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,181 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,183 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,184 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,186 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,188 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,189 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,191 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,193 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,194 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,564 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,566 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,568 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:20,570 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:21,177 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:21,180 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:21,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,184 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-15 14:14:21,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-15 14:14:21,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:21,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:21,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-15 14:14:21,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 [2023-02-15 14:14:21,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-15 14:14:21,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,338 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-15 14:14:21,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,373 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-15 14:14:21,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,408 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-15 14:14:21,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,425 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-15 14:14:21,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,447 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-15 14:14:21,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:21,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:21,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,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 [2023-02-15 14:14:21,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,469 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-15 14:14:21,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 [2023-02-15 14:14:21,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,488 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-15 14:14:21,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,514 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-15 14:14:21,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,538 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-15 14:14:21,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,560 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-15 14:14:21,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:21,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:21,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:21,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,574 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-15 14:14:21,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:21,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:21,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,596 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-15 14:14:21,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:21,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:21,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:21,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,620 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-15 14:14:21,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:21,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:21,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:21,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:21,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:21,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:21,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:21,647 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:21,690 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-02-15 14:14:21,690 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-02-15 14:14:21,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:21,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:21,772 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:21,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-15 14:14:21,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:21,810 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 14:14:21,810 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:21,811 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1, ULTIMATE.start_cstrcspn_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset Supporting invariants [] [2023-02-15 14:14:21,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:21,831 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2023-02-15 14:14:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:21,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:21,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:21,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:21,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:21,938 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 14:14:21,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:21,978 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. 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 44 states and 52 transitions. Complement of second has 4 states. [2023-02-15 14:14:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:14:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2023-02-15 14:14:21,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2023-02-15 14:14:21,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:21,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2023-02-15 14:14:21,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:21,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2023-02-15 14:14:21,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:21,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2023-02-15 14:14:21,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:21,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2023-02-15 14:14:21,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-15 14:14:21,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-02-15 14:14:21,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2023-02-15 14:14:21,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:21,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-02-15 14:14:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2023-02-15 14:14:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-15 14:14:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-02-15 14:14:21,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-02-15 14:14:21,986 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-02-15 14:14:21,986 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 14:14:21,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2023-02-15 14:14:21,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:21,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:21,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:21,987 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:21,987 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:21,987 INFO L748 eck$LassoCheckResult]: Stem: 304#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 292#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; 293#L14 assume !(build_nondet_String_~length~0#1 < 1); 294#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 285#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 286#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 295#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 302#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 303#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 296#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 297#L33-5 [2023-02-15 14:14:21,987 INFO L750 eck$LassoCheckResult]: Loop: 297#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 287#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 288#L33-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 297#L33-5 [2023-02-15 14:14:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2023-02-15 14:14:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:21,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932394092] [2023-02-15 14:14:21,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:21,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2023-02-15 14:14:22,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:22,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133426066] [2023-02-15 14:14:22,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:22,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2023-02-15 14:14:22,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:22,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67671042] [2023-02-15 14:14:22,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:22,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:22,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:22,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:22,667 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:22,667 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:22,667 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:22,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:22,667 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:22,667 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:22,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:22,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:22,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration4_Lasso [2023-02-15 14:14:22,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:22,668 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:22,670 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:22,672 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:22,674 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:22,675 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:22,677 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:22,678 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:22,679 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,017 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,019 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,020 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,022 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,024 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,025 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,027 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,028 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,030 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,031 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,032 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,034 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:23,744 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:23,745 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:23,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:23,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:23,746 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:23,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-02-15 14:14:23,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:23,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:23,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:23,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:23,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:23,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:23,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:23,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:23,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:23,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:23,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:23,779 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:23,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-02-15 14:14:23,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:23,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:23,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:23,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:23,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:23,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:23,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:23,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:23,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:23,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:23,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:23,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:23,817 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:23,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-15 14:14:23,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:23,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:23,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:23,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:23,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:23,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:23,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:23,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:23,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:23,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:23,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:23,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:23,848 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:23,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-15 14:14:23,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:23,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:23,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:23,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:23,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:23,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:23,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:23,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:23,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:23,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:23,883 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:23,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-15 14:14:23,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:23,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:23,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:23,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:23,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:23,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:23,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:23,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:23,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:23,911 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 [2023-02-15 14:14:23,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:23,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:23,912 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:23,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-15 14:14:23,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:23,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:23,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:23,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:23,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:23,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:23,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:23,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:23,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:23,926 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 [2023-02-15 14:14:23,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:23,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:23,927 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:23,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-15 14:14:23,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:23,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:23,942 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-15 14:14:23,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:23,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:23,953 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2023-02-15 14:14:23,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:23,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:23,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-02-15 14:14:23,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:23,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:23,979 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:23,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-15 14:14:23,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:23,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:23,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:23,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:23,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:23,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:23,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:24,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:24,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:24,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:24,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:24,013 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-02-15 14:14:24,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-15 14:14:24,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:24,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:24,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:24,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:24,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:24,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:24,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:24,046 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:24,057 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-02-15 14:14:24,057 INFO L444 ModelExtractionUtils]: 8 out of 34 variables were initially zero. Simplification set additionally 23 variables to zero. [2023-02-15 14:14:24,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:24,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:24,059 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) [2023-02-15 14:14:24,061 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 [2023-02-15 14:14:24,062 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:24,079 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 14:14:24,079 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:24,079 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2) = -1*ULTIMATE.start_cstrcspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2 Supporting invariants [] [2023-02-15 14:14:24,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:24,103 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2023-02-15 14:14:24,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:24,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:24,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:24,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:24,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:24,179 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-15 14:14:24,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 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) [2023-02-15 14:14:24,239 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. 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 49 states and 59 transitions. Complement of second has 7 states. [2023-02-15 14:14:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:14:24,240 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) [2023-02-15 14:14:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-15 14:14:24,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2023-02-15 14:14:24,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:24,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2023-02-15 14:14:24,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:24,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2023-02-15 14:14:24,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:24,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2023-02-15 14:14:24,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:24,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2023-02-15 14:14:24,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-02-15 14:14:24,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-02-15 14:14:24,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2023-02-15 14:14:24,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:24,243 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 42 transitions. [2023-02-15 14:14:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2023-02-15 14:14:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2023-02-15 14:14:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-02-15 14:14:24,245 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-02-15 14:14:24,245 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-02-15 14:14:24,245 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 14:14:24,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2023-02-15 14:14:24,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:24,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:24,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:24,246 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:24,247 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:24,248 INFO L748 eck$LassoCheckResult]: Stem: 479#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 465#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; 466#L14 assume !(build_nondet_String_~length~0#1 < 1); 467#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 459#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 460#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 468#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 477#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 478#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 471#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 472#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 463#L33-1 assume !cstrcspn_#t~short7#1; 464#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 473#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 474#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 481#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 482#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 469#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 470#L33-5 [2023-02-15 14:14:24,248 INFO L750 eck$LassoCheckResult]: Loop: 470#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 461#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 462#L33-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 470#L33-5 [2023-02-15 14:14:24,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 2 times [2023-02-15 14:14:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:24,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979692679] [2023-02-15 14:14:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:24,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2023-02-15 14:14:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:24,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066477782] [2023-02-15 14:14:24,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:24,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash -238092697, now seen corresponding path program 1 times [2023-02-15 14:14:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:24,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642011154] [2023-02-15 14:14:24,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:24,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:14:24,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642011154] [2023-02-15 14:14:24,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642011154] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:14:24,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151486567] [2023-02-15 14:14:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:14:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:24,462 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:14:24,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-02-15 14:14:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:24,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 14:14:24,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:24,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 14:14:24,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-02-15 14:14:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:24,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:14:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:24,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151486567] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:14:24,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:14:24,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 16 [2023-02-15 14:14:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817466415] [2023-02-15 14:14:24,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:14:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:14:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 14:14:24,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-02-15 14:14:24,731 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:14:24,891 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2023-02-15 14:14:24,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2023-02-15 14:14:24,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:24,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 45 states and 54 transitions. [2023-02-15 14:14:24,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-15 14:14:24,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-02-15 14:14:24,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2023-02-15 14:14:24,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:14:24,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-02-15 14:14:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2023-02-15 14:14:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2023-02-15 14:14:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-02-15 14:14:24,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-15 14:14:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 14:14:24,917 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-15 14:14:24,918 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 14:14:24,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2023-02-15 14:14:24,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-15 14:14:24,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:14:24,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:14:24,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:14:24,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-15 14:14:24,920 INFO L748 eck$LassoCheckResult]: Stem: 717#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 704#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; 705#L14 assume !(build_nondet_String_~length~0#1 < 1); 706#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 698#build_nondet_String_returnLabel#1 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 699#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 707#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 715#build_nondet_String_returnLabel#2 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#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 cstrcspn_#res#1;havoc cstrcspn_#t~mem4#1, cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset, cstrcspn_#t~mem5#1, cstrcspn_#t~mem6#1, cstrcspn_#t~short7#1, cstrcspn_#t~mem9#1, cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 716#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 722#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 725#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 702#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 703#L33-3 assume !cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1; 712#L33-6 call cstrcspn_#t~mem9#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 713#L35 assume !(cstrcspn_#t~mem9#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem9#1; 720#L30-3 cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset; 721#L30-4 call cstrcspn_#t~mem3#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 708#L30-1 assume !!(0 != cstrcspn_#t~mem3#1);havoc cstrcspn_#t~mem3#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem4#1 := read~int(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem4#1; 709#L33-5 [2023-02-15 14:14:24,920 INFO L750 eck$LassoCheckResult]: Loop: 709#L33-5 call cstrcspn_#t~mem5#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := 0 != cstrcspn_#t~mem5#1; 700#L33-1 assume cstrcspn_#t~short7#1;call cstrcspn_#t~mem6#1 := read~int(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short7#1 := cstrcspn_#t~mem6#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 701#L33-3 assume !!cstrcspn_#t~short7#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~mem6#1;havoc cstrcspn_#t~short7#1;cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post8#1.base, 1 + cstrcspn_#t~post8#1.offset;havoc cstrcspn_#t~post8#1.base, cstrcspn_#t~post8#1.offset; 709#L33-5 [2023-02-15 14:14:24,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 1 times [2023-02-15 14:14:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:24,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268761099] [2023-02-15 14:14:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:24,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:24,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2023-02-15 14:14:24,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:24,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094768713] [2023-02-15 14:14:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:24,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2023-02-15 14:14:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:14:24,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341847347] [2023-02-15 14:14:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:14:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:14:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:25,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:14:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:14:25,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:14:25,921 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:14:25,921 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:14:25,921 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:14:25,921 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:14:25,921 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:14:25,921 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:25,921 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:14:25,921 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:14:25,921 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration6_Lasso [2023-02-15 14:14:25,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:14:25,921 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:14:25,923 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:25,929 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,488 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,489 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,494 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,497 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,498 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,501 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,502 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,503 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,505 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,506 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,509 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,510 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,511 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,513 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:26,514 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:14:27,625 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:14:27,625 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:14:27,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,626 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) [2023-02-15 14:14:27,628 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 [2023-02-15 14:14:27,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:14:27,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:14:27,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:14:27,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,643 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 [2023-02-15 14:14:27,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,645 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) [2023-02-15 14:14:27,646 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 [2023-02-15 14:14:27,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:27,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:27,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,707 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 [2023-02-15 14:14:27,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,709 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) [2023-02-15 14:14:27,713 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 [2023-02-15 14:14:27,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:27,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:27,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:27,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:27,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:27,735 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 [2023-02-15 14:14:27,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:27,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:27,736 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) [2023-02-15 14:14:27,737 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 [2023-02-15 14:14:27,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:27,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:27,746 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2023-02-15 14:14:27,746 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2023-02-15 14:14:27,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:27,835 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2023-02-15 14:14:27,835 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2023-02-15 14:14:28,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:28,016 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 [2023-02-15 14:14:28,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:28,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:28,018 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) [2023-02-15 14:14:28,019 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 [2023-02-15 14:14:28,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:28,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:28,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:28,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:28,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:28,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:28,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:28,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:28,047 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 [2023-02-15 14:14:28,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:28,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:28,049 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) [2023-02-15 14:14:28,050 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 [2023-02-15 14:14:28,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:28,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:28,059 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-15 14:14:28,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:28,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:28,069 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2023-02-15 14:14:28,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:28,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:14:28,091 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 [2023-02-15 14:14:28,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:28,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:28,093 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) [2023-02-15 14:14:28,094 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 [2023-02-15 14:14:28,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-15 14:14:28,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:14:28,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:14:28,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:14:28,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:14:28,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:14:28,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:14:28,120 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:14:28,141 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-02-15 14:14:28,141 INFO L444 ModelExtractionUtils]: 26 out of 43 variables were initially zero. Simplification set additionally 14 variables to zero. [2023-02-15 14:14:28,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:14:28,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:14:28,143 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) [2023-02-15 14:14:28,143 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 [2023-02-15 14:14:28,145 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:14:28,152 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-02-15 14:14:28,152 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:14:28,152 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_cstrcspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0#1.offset Supporting invariants [] [2023-02-15 14:14:28,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-02-15 14:14:28,211 INFO L156 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2023-02-15 14:14:28,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:28,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:28,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:28,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:28,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:28,314 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-15 14:14:28,314 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:28,358 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. 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 49 states and 60 transitions. Complement of second has 7 states. [2023-02-15 14:14:28,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:14:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-15 14:14:28,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-15 14:14:28,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:28,360 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:28,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:28,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:28,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:28,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:28,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:28,483 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-15 14:14:28,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:28,522 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. 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 49 states and 60 transitions. Complement of second has 7 states. [2023-02-15 14:14:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:14:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-15 14:14:28,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-15 14:14:28,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:28,523 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:14:28,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:14:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:28,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 14:14:28,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:14:28,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:14:28,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:14:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:14:28,626 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2023-02-15 14:14:28,627 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:28,669 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. 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 48 states and 62 transitions. Complement of second has 6 states. [2023-02-15 14:14:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-15 14:14:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:14:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2023-02-15 14:14:28,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 3 letters. [2023-02-15 14:14:28,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:28,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 21 letters. Loop has 3 letters. [2023-02-15 14:14:28,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:28,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 6 letters. [2023-02-15 14:14:28,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:14:28,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2023-02-15 14:14:28,673 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-15 14:14:28,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2023-02-15 14:14:28,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-15 14:14:28,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-15 14:14:28,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-15 14:14:28,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-15 14:14:28,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:14:28,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:14:28,673 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:14:28,673 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 14:14:28,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-15 14:14:28,674 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-15 14:14:28,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-15 14:14:28,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.02 02:14:28 BoogieIcfgContainer [2023-02-15 14:14:28,678 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-15 14:14:28,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 14:14:28,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 14:14:28,679 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 14:14:28,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:14:18" (3/4) ... [2023-02-15 14:14:28,681 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 14:14:28,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 14:14:28,681 INFO L158 Benchmark]: Toolchain (without parser) took 10854.18ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 105.0MB in the beginning and 76.5MB in the end (delta: 28.4MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2023-02-15 14:14:28,681 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 115.3MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:14:28,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 132.54ms. Allocated memory is still 138.4MB. Free memory was 105.0MB in the beginning and 95.0MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 14:14:28,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.88ms. Allocated memory is still 138.4MB. Free memory was 95.0MB in the beginning and 93.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:14:28,682 INFO L158 Benchmark]: Boogie Preprocessor took 40.65ms. Allocated memory is still 138.4MB. Free memory was 93.4MB in the beginning and 91.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:14:28,682 INFO L158 Benchmark]: RCFGBuilder took 349.14ms. Allocated memory is still 138.4MB. Free memory was 91.8MB in the beginning and 105.5MB in the end (delta: -13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 14:14:28,682 INFO L158 Benchmark]: BuchiAutomizer took 10293.95ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 105.5MB in the beginning and 76.5MB in the end (delta: 29.0MB). Peak memory consumption was 100.3MB. Max. memory is 16.1GB. [2023-02-15 14:14:28,682 INFO L158 Benchmark]: Witness Printer took 2.14ms. Allocated memory is still 207.6MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:14:28,683 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.10ms. Allocated memory is still 115.3MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 132.54ms. Allocated memory is still 138.4MB. Free memory was 105.0MB in the beginning and 95.0MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.88ms. Allocated memory is still 138.4MB. Free memory was 95.0MB in the beginning and 93.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.65ms. Allocated memory is still 138.4MB. Free memory was 93.4MB in the beginning and 91.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 349.14ms. Allocated memory is still 138.4MB. Free memory was 91.8MB in the beginning and 105.5MB in the end (delta: -13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 10293.95ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 105.5MB in the beginning and 76.5MB in the end (delta: 29.0MB). Peak memory consumption was 100.3MB. Max. memory is 16.1GB. * Witness Printer took 2.14ms. Allocated memory is still 207.6MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 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, 245 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 130 mSDtfsCounter, 276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital283 mio100 ax100 hnf100 lsp100 ukn74 mio100 lsp30 div167 bol100 ite100 ukn100 eq160 hnf100 smp68 dnf716 smp55 tf100 neg95 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 272ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-02-15 14:14:28,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-02-15 14:14:28,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-02-15 14:14:29,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE