./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/array-memsafety/strreplace-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 961e7f6fbd61acd9d4f1771460dcf26fd486b3de35e5e0e3ca8e6e03bda0fabc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:37,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:37,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:37,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:37,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:37,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:37,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:37,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:37,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:37,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:37,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:37,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:37,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:37,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:37,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:37,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:37,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:37,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:37,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:37,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:37,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:37,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:37,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:37,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:37,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:37,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:37,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:37,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:37,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:37,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:37,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:37,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:37,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:37,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:37,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:37,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:37,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:37,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:37,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:37,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:37,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:37,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:37,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:37,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:37,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:37,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:37,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:37,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:37,579 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:37,579 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:37,579 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:37,580 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:37,580 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:37,580 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:37,581 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:37,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:37,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:37,581 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:37,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:37,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:37,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:37,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:37,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:37,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:37,582 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:37,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:37,582 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:37,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:37,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:37,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:37,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:37,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:37,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:37,584 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:37,584 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 961e7f6fbd61acd9d4f1771460dcf26fd486b3de35e5e0e3ca8e6e03bda0fabc [2022-02-21 04:35:37,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:37,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:37,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:37,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:37,834 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:37,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2022-02-21 04:35:37,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94c5cedb/62df7e8718a74fb7a919fe6fb0d17e69/FLAGd7dbcd2c2 [2022-02-21 04:35:38,398 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:38,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/strreplace-alloca-2.i [2022-02-21 04:35:38,416 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94c5cedb/62df7e8718a74fb7a919fe6fb0d17e69/FLAGd7dbcd2c2 [2022-02-21 04:35:38,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94c5cedb/62df7e8718a74fb7a919fe6fb0d17e69 [2022-02-21 04:35:38,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:38,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:38,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:38,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:38,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:38,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:38" (1/1) ... [2022-02-21 04:35:38,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad2368a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:38, skipping insertion in model container [2022-02-21 04:35:38,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:38" (1/1) ... [2022-02-21 04:35:38,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:38,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:39,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:39,243 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:39,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:39,292 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:39,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39 WrapperNode [2022-02-21 04:35:39,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:39,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:39,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:39,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:39,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,338 INFO L137 Inliner]: procedures = 117, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2022-02-21 04:35:39,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:39,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:39,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:39,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:39,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:39,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:39,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:39,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:39,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (1/1) ... [2022-02-21 04:35:39,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:39,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:39,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:39,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:35:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:39,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:39,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:39,498 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:39,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:39,668 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:39,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:39,672 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:35:39,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:39 BoogieIcfgContainer [2022-02-21 04:35:39,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:39,682 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:39,682 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:39,685 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:39,685 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:39,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:38" (1/3) ... [2022-02-21 04:35:39,686 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c77041e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:39, skipping insertion in model container [2022-02-21 04:35:39,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:39,686 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:39" (2/3) ... [2022-02-21 04:35:39,687 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c77041e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:39, skipping insertion in model container [2022-02-21 04:35:39,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:39,687 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:39" (3/3) ... [2022-02-21 04:35:39,688 INFO L388 chiAutomizerObserver]: Analyzing ICFG strreplace-alloca-2.i [2022-02-21 04:35:39,724 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:39,724 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:39,724 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:39,724 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:39,724 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:39,725 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:39,725 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:39,725 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:39,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:39,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,764 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:35:39,765 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:39,765 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:39,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:39,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:39,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:39,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:39,770 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 04:35:39,770 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:39,775 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~ret12#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 13#L528true assume !(main_~length1~0#1 < 1); 7#L528-2true call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 11#L533-3true [2022-02-21 04:35:39,776 INFO L793 eck$LassoCheckResult]: Loop: 11#L533-3true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet9#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet9#1; 3#L533-2true main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 11#L533-3true [2022-02-21 04:35:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-02-21 04:35:39,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:39,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265686468] [2022-02-21 04:35:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,923 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:39,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2022-02-21 04:35:39,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:39,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983621918] [2022-02-21 04:35:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,940 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:39,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2022-02-21 04:35:39,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:39,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038575829] [2022-02-21 04:35:39,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:39,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,959 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:39,970 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:40,180 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:40,180 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:40,180 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:40,180 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:40,180 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:40,181 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,181 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:40,181 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:40,181 INFO L133 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:40,181 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:40,181 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:40,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:40,571 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:40,574 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:40,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:35:40,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:40,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:40,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:40,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:35:40,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:35:40,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:40,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:40,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:40,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:40,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:40,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:40,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:35:40,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:40,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:40,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:40,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,801 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:40,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:40,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:40,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:40,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:40,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:40,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:40,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:40,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:40,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:40,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:40,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:40,951 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:40,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:40,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:40,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:40,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:40,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:40,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:40,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:40,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:40,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:40,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 04:35:41,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,002 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:41,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:41,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:41,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:41,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:41,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:41,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:41,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:41,048 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:41,102 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-02-21 04:35:41,102 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 04:35:41,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:41,105 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:41,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:35:41,144 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:41,168 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:41,168 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:41,169 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc7#1.base)_1 - 1*ULTIMATE.start_main_~length1~0#1 >= 0] [2022-02-21 04:35:41,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:41,222 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 04:35:41,233 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet9#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet9#1;" "main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2022-02-21 04:35:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:35:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:41,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 04:35:41,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~ret12#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {26#unseeded} is VALID [2022-02-21 04:35:41,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~length1~0#1 < 1); {26#unseeded} is VALID [2022-02-21 04:35:41,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#unseeded} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; {61#(and unseeded (>= (+ (* (- 1) |ULTIMATE.start_main_~length1~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)) 0) (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|))} is VALID [2022-02-21 04:35:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:35:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:41,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (>= (+ (* (- 1) |ULTIMATE.start_main_~length1~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)) 0) (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|))} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet9#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet9#1; {79#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (>= (+ (* (- 1) |ULTIMATE.start_main_~length1~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)) 0) (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|))} is VALID [2022-02-21 04:35:41,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~length1~0#1|) (>= (+ (* (- 1) |ULTIMATE.start_main_~length1~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)) 0) (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {64#(and (>= (+ (* (- 1) |ULTIMATE.start_main_~length1~0#1|) (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)) 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~nondetString1~0#1.base|))))) (= |ULTIMATE.start_main_~nondetString1~0#1.base| |ULTIMATE.start_main_#t~malloc7#1.base|))} is VALID [2022-02-21 04:35:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:41,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:41,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:41,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,423 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:41,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,539 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Result 35 states and 48 transitions. Complement of second has 8 states. [2022-02-21 04:35:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:41,540 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:41,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:41,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:41,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:41,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:41,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:41,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:41,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. [2022-02-21 04:35:41,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:41,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:41,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:41,557 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 04:35:41,559 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 04:35:41,559 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:41,562 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:41,562 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 48 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:41,564 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:41,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:41,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:41,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:41,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:41,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:41,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:41,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:35:41,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:35:41,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 35 letters. Loop has 35 letters. [2022-02-21 04:35:41,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:41,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:41,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:41,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:41,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:41,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:41,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:41,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:41,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:41,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:41,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:41,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:41,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:41,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:41,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:41,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:41,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:41,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:41,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:41,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:41,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:41,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:41,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:41,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:41,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:41,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:41,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:41,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:41,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:41,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:41,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:41,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:41,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:41,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:41,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:41,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:41,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:35:41,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:41,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:41,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:35:41,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,602 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-21 04:35:41,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 04:35:41,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:41,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:41,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:41,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. cyclomatic complexity: 17 [2022-02-21 04:35:41,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:41,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 16 transitions. [2022-02-21 04:35:41,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 04:35:41,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:41,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 04:35:41,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:41,620 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 04:35:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 04:35:41,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:41,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,640 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,641 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:41,643 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 04:35:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:41,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:41,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:41,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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) Second operand 12 states and 16 transitions. [2022-02-21 04:35:41,644 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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) Second operand 12 states and 16 transitions. [2022-02-21 04:35:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:41,646 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 04:35:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:41,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:41,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:41,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:41,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:41,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 04:35:41,649 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:41,649 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 04:35:41,649 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:41,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 04:35:41,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:41,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:41,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:41,650 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:41,650 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:35:41,651 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~ret12#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 134#L528 assume !(main_~length1~0#1 < 1); 135#L528-2 call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 130#L533-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 132#L533-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);assume { :begin_inline_cstrreplace } true;cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset, cstrreplace_#in~old#1, cstrreplace_#in~new#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, (if main_#t~nondet10#1 % 256 <= 127 then main_#t~nondet10#1 % 256 else main_#t~nondet10#1 % 256 - 256), (if main_#t~nondet11#1 % 256 <= 127 then main_#t~nondet11#1 % 256 else main_#t~nondet11#1 % 256 - 256);havoc cstrreplace_#res#1;havoc cstrreplace_#t~mem3#1, cstrreplace_#t~post4#1, cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset, cstrreplace_#t~mem2#1, cstrreplace_~s#1.base, cstrreplace_~s#1.offset, cstrreplace_~old#1, cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, cstrreplace_~numReplaced~0#1;cstrreplace_~s#1.base, cstrreplace_~s#1.offset := cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset;cstrreplace_~old#1 := cstrreplace_#in~old#1;cstrreplace_~new#1 := cstrreplace_#in~new#1;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_~s#1.base, cstrreplace_~s#1.offset;cstrreplace_~numReplaced~0#1 := 0; 138#L517-3 [2022-02-21 04:35:41,651 INFO L793 eck$LassoCheckResult]: Loop: 138#L517-3 call cstrreplace_#t~mem2#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1); 140#L517-1 assume !!(0 != cstrreplace_#t~mem2#1);havoc cstrreplace_#t~mem2#1;call cstrreplace_#t~mem3#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1); 141#L518 assume cstrreplace_#t~mem3#1 == cstrreplace_~old#1;havoc cstrreplace_#t~mem3#1;call write~int(cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);cstrreplace_#t~post4#1 := cstrreplace_~numReplaced~0#1;cstrreplace_~numReplaced~0#1 := 1 + cstrreplace_#t~post4#1;havoc cstrreplace_#t~post4#1; 139#L518-2 cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset := cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_#t~post5#1.base, 1 + cstrreplace_#t~post5#1.offset;havoc cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset; 138#L517-3 [2022-02-21 04:35:41,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:41,652 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2022-02-21 04:35:41,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:41,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40793936] [2022-02-21 04:35:41,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:41,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:41,699 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:41,722 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1790538, now seen corresponding path program 1 times [2022-02-21 04:35:41,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:41,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990907174] [2022-02-21 04:35:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:41,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:41,750 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1952978730, now seen corresponding path program 1 times [2022-02-21 04:35:41,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:41,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918692084] [2022-02-21 04:35:41,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:41,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:41,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {173#true} is VALID [2022-02-21 04:35:41,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~ret12#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {173#true} is VALID [2022-02-21 04:35:41,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume !(main_~length1~0#1 < 1); {175#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} is VALID [2022-02-21 04:35:41,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {175#(<= 1 |ULTIMATE.start_main_~length1~0#1|)} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; {176#(and (or (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} is VALID [2022-02-21 04:35:41,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {176#(and (or (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)))} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {177#(and (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} is VALID [2022-02-21 04:35:41,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(and (= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (not (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 0)) (<= (+ |ULTIMATE.start_main_~nondetString1~0#1.offset| |ULTIMATE.start_main_~length1~0#1|) 1))} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);assume { :begin_inline_cstrreplace } true;cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset, cstrreplace_#in~old#1, cstrreplace_#in~new#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, (if main_#t~nondet10#1 % 256 <= 127 then main_#t~nondet10#1 % 256 else main_#t~nondet10#1 % 256 - 256), (if main_#t~nondet11#1 % 256 <= 127 then main_#t~nondet11#1 % 256 else main_#t~nondet11#1 % 256 - 256);havoc cstrreplace_#res#1;havoc cstrreplace_#t~mem3#1, cstrreplace_#t~post4#1, cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset, cstrreplace_#t~mem2#1, cstrreplace_~s#1.base, cstrreplace_~s#1.offset, cstrreplace_~old#1, cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, cstrreplace_~numReplaced~0#1;cstrreplace_~s#1.base, cstrreplace_~s#1.offset := cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset;cstrreplace_~old#1 := cstrreplace_#in~old#1;cstrreplace_~new#1 := cstrreplace_#in~new#1;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_~s#1.base, cstrreplace_~s#1.offset;cstrreplace_~numReplaced~0#1 := 0; {178#(= (select (select |#memory_int| |ULTIMATE.start_cstrreplace_~p~0#1.base|) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) 0)} is VALID [2022-02-21 04:35:41,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(= (select (select |#memory_int| |ULTIMATE.start_cstrreplace_~p~0#1.base|) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) 0)} call cstrreplace_#t~mem2#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1); {179#(= |ULTIMATE.start_cstrreplace_#t~mem2#1| 0)} is VALID [2022-02-21 04:35:41,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(= |ULTIMATE.start_cstrreplace_#t~mem2#1| 0)} assume !!(0 != cstrreplace_#t~mem2#1);havoc cstrreplace_#t~mem2#1;call cstrreplace_#t~mem3#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1); {174#false} is VALID [2022-02-21 04:35:41,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {174#false} assume cstrreplace_#t~mem3#1 == cstrreplace_~old#1;havoc cstrreplace_#t~mem3#1;call write~int(cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);cstrreplace_#t~post4#1 := cstrreplace_~numReplaced~0#1;cstrreplace_~numReplaced~0#1 := 1 + cstrreplace_#t~post4#1;havoc cstrreplace_#t~post4#1; {174#false} is VALID [2022-02-21 04:35:41,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#false} cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset := cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_#t~post5#1.base, 1 + cstrreplace_#t~post5#1.offset;havoc cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset; {174#false} is VALID [2022-02-21 04:35:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:41,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:41,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918692084] [2022-02-21 04:35:41,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918692084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:41,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:41,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 04:35:41,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069174348] [2022-02-21 04:35:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:41,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:41,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 04:35:41,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 04:35:41,937 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:42,039 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 04:35:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:35:42,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:42,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2022-02-21 04:35:42,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:42,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 16 transitions. [2022-02-21 04:35:42,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 04:35:42,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 04:35:42,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-02-21 04:35:42,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:42,051 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 04:35:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-02-21 04:35:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-02-21 04:35:42,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:42,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,052 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,052 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:42,053 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:42,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:42,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:42,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 13 states and 16 transitions. [2022-02-21 04:35:42,054 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 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 13 states and 16 transitions. [2022-02-21 04:35:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:42,054 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2022-02-21 04:35:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2022-02-21 04:35:42,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:42,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:42,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:42,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-21 04:35:42,056 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 04:35:42,056 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 04:35:42,056 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:42,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-02-21 04:35:42,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:35:42,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:42,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:42,057 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:42,057 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:35:42,057 INFO L791 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~ret12#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 204#L528 assume !(main_~length1~0#1 < 1); 205#L528-2 call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; 200#L533-3 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet9#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet9#1; 201#L533-2 main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 202#L533-3 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 203#L533-4 call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);assume { :begin_inline_cstrreplace } true;cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset, cstrreplace_#in~old#1, cstrreplace_#in~new#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, (if main_#t~nondet10#1 % 256 <= 127 then main_#t~nondet10#1 % 256 else main_#t~nondet10#1 % 256 - 256), (if main_#t~nondet11#1 % 256 <= 127 then main_#t~nondet11#1 % 256 else main_#t~nondet11#1 % 256 - 256);havoc cstrreplace_#res#1;havoc cstrreplace_#t~mem3#1, cstrreplace_#t~post4#1, cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset, cstrreplace_#t~mem2#1, cstrreplace_~s#1.base, cstrreplace_~s#1.offset, cstrreplace_~old#1, cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, cstrreplace_~numReplaced~0#1;cstrreplace_~s#1.base, cstrreplace_~s#1.offset := cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset;cstrreplace_~old#1 := cstrreplace_#in~old#1;cstrreplace_~new#1 := cstrreplace_#in~new#1;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_~s#1.base, cstrreplace_~s#1.offset;cstrreplace_~numReplaced~0#1 := 0; 208#L517-3 [2022-02-21 04:35:42,057 INFO L793 eck$LassoCheckResult]: Loop: 208#L517-3 call cstrreplace_#t~mem2#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1); 210#L517-1 assume !!(0 != cstrreplace_#t~mem2#1);havoc cstrreplace_#t~mem2#1;call cstrreplace_#t~mem3#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1); 211#L518 assume cstrreplace_#t~mem3#1 == cstrreplace_~old#1;havoc cstrreplace_#t~mem3#1;call write~int(cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);cstrreplace_#t~post4#1 := cstrreplace_~numReplaced~0#1;cstrreplace_~numReplaced~0#1 := 1 + cstrreplace_#t~post4#1;havoc cstrreplace_#t~post4#1; 209#L518-2 cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset := cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_#t~post5#1.base, 1 + cstrreplace_#t~post5#1.offset;havoc cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset; 208#L517-3 [2022-02-21 04:35:42,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2022-02-21 04:35:42,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748017277] [2022-02-21 04:35:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,080 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1790538, now seen corresponding path program 2 times [2022-02-21 04:35:42,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822944651] [2022-02-21 04:35:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,087 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,090 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash -357903304, now seen corresponding path program 1 times [2022-02-21 04:35:42,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:42,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553176928] [2022-02-21 04:35:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,109 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:42,121 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:42,605 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:42,605 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:42,605 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:42,605 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:42,606 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:42,606 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:42,606 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:42,606 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:42,606 INFO L133 ssoRankerPreferences]: Filename of dumped script: strreplace-alloca-2.i_Iteration3_Lasso [2022-02-21 04:35:42,606 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:42,606 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:42,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,985 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:42,987 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:42,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:42,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:43,662 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:43,662 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:43,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,663 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:35:43,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:43,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:43,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:43,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,732 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:35:43,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:43,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:43,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:43,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,776 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:35:43,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:43,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:43,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:43,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,819 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:35:43,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:43,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:43,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,886 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:35:43,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:43,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:43,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:43,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:43,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:43,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:43,934 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:43,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:35:43,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:43,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:43,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:43,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:43,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:43,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:43,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:43,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:44,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:44,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,025 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:35:44,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:44,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:44,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:44,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:44,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:44,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:44,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:44,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,074 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:35:44,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:44,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:44,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:44,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:44,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:44,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:44,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:35:44,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,152 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:35:44,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:44,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:44,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:44,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:44,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:44,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:44,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:44,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,184 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:35:44,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:44,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:44,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:44,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:44,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:44,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 04:35:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,244 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:35:44,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:44,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:44,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:44,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:44,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:44,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:44,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,310 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:35:44,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 [2022-02-21 04:35:44,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,319 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 04:35:44,319 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:35:44,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,344 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-02-21 04:35:44,345 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 04:35:44,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,381 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 [2022-02-21 04:35:44,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,383 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:35:44,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:44,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:44,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:44,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:44,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:44,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:44,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,431 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:35:44,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:44,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:44,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:44,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:44,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:44,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 04:35:44,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,483 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:35:44,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:44,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,492 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 04:35:44,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:44,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,495 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-02-21 04:35:44,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:44,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:44,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:44,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,517 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:35:44,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:44,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:44,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:44,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:44,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:44,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:44,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:44,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:44,564 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-02-21 04:35:44,564 INFO L444 ModelExtractionUtils]: 6 out of 31 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-02-21 04:35:44,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:44,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:44,565 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:35:44,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 04:35:44,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:44,577 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:44,577 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:44,577 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrreplace_~p~0#1.base)_1, ULTIMATE.start_cstrreplace_~p~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_cstrreplace_~p~0#1.base)_1 - 1*ULTIMATE.start_cstrreplace_~p~0#1.offset Supporting invariants [] [2022-02-21 04:35:44,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:44,622 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 04:35:44,628 INFO L390 LassoCheck]: Loop: "call cstrreplace_#t~mem2#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);" "assume !!(0 != cstrreplace_#t~mem2#1);havoc cstrreplace_#t~mem2#1;call cstrreplace_#t~mem3#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);" "assume cstrreplace_#t~mem3#1 == cstrreplace_~old#1;havoc cstrreplace_#t~mem3#1;call write~int(cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);cstrreplace_#t~post4#1 := cstrreplace_~numReplaced~0#1;cstrreplace_~numReplaced~0#1 := 1 + cstrreplace_#t~post4#1;havoc cstrreplace_#t~post4#1;" "cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset := cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_#t~post5#1.base, 1 + cstrreplace_#t~post5#1.offset;havoc cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset;" [2022-02-21 04:35:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:44,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {247#unseeded} is VALID [2022-02-21 04:35:44,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet9#1, main_#t~post8#1, main_~i~0#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~ret12#1, main_~length1~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {247#unseeded} is VALID [2022-02-21 04:35:44,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#unseeded} assume !(main_~length1~0#1 < 1); {247#unseeded} is VALID [2022-02-21 04:35:44,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#unseeded} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnStack(main_~length1~0#1);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;main_~i~0#1 := 0; {247#unseeded} is VALID [2022-02-21 04:35:44,688 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#unseeded} assume !!(main_~i~0#1 < main_~length1~0#1 - 1);call write~int(main_#t~nondet9#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet9#1; {247#unseeded} is VALID [2022-02-21 04:35:44,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#unseeded} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {247#unseeded} is VALID [2022-02-21 04:35:44,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {247#unseeded} assume !(main_~i~0#1 < main_~length1~0#1 - 1); {247#unseeded} is VALID [2022-02-21 04:35:44,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#unseeded} call write~int(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);assume { :begin_inline_cstrreplace } true;cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset, cstrreplace_#in~old#1, cstrreplace_#in~new#1 := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, (if main_#t~nondet10#1 % 256 <= 127 then main_#t~nondet10#1 % 256 else main_#t~nondet10#1 % 256 - 256), (if main_#t~nondet11#1 % 256 <= 127 then main_#t~nondet11#1 % 256 else main_#t~nondet11#1 % 256 - 256);havoc cstrreplace_#res#1;havoc cstrreplace_#t~mem3#1, cstrreplace_#t~post4#1, cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset, cstrreplace_#t~mem2#1, cstrreplace_~s#1.base, cstrreplace_~s#1.offset, cstrreplace_~old#1, cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, cstrreplace_~numReplaced~0#1;cstrreplace_~s#1.base, cstrreplace_~s#1.offset := cstrreplace_#in~s#1.base, cstrreplace_#in~s#1.offset;cstrreplace_~old#1 := cstrreplace_#in~old#1;cstrreplace_~new#1 := cstrreplace_#in~new#1;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_~s#1.base, cstrreplace_~s#1.offset;cstrreplace_~numReplaced~0#1 := 0; {247#unseeded} is VALID [2022-02-21 04:35:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:35:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:44,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:44,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {250#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|)))} call cstrreplace_#t~mem2#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1); {311#(and (<= (+ |ULTIMATE.start_cstrreplace_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|))))} is VALID [2022-02-21 04:35:44,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#(and (<= (+ |ULTIMATE.start_cstrreplace_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|))))} assume !!(0 != cstrreplace_#t~mem2#1);havoc cstrreplace_#t~mem2#1;call cstrreplace_#t~mem3#1 := read~int(cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1); {311#(and (<= (+ |ULTIMATE.start_cstrreplace_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|))))} is VALID [2022-02-21 04:35:44,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#(and (<= (+ |ULTIMATE.start_cstrreplace_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|))))} assume cstrreplace_#t~mem3#1 == cstrreplace_~old#1;havoc cstrreplace_#t~mem3#1;call write~int(cstrreplace_~new#1, cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset, 1);cstrreplace_#t~post4#1 := cstrreplace_~numReplaced~0#1;cstrreplace_~numReplaced~0#1 := 1 + cstrreplace_#t~post4#1;havoc cstrreplace_#t~post4#1; {311#(and (<= (+ |ULTIMATE.start_cstrreplace_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|))))} is VALID [2022-02-21 04:35:44,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {311#(and (<= (+ |ULTIMATE.start_cstrreplace_~p~0#1.offset| 1) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|)) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|))))} cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset := cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset;cstrreplace_~p~0#1.base, cstrreplace_~p~0#1.offset := cstrreplace_#t~post5#1.base, 1 + cstrreplace_#t~post5#1.offset;havoc cstrreplace_#t~post5#1.base, cstrreplace_#t~post5#1.offset; {285#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_cstrreplace_~p~0#1.offset|) (select |#length| |ULTIMATE.start_cstrreplace_~p~0#1.base|)))))} is VALID [2022-02-21 04:35:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:44,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:44,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:44,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:44,745 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,771 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 states and 21 transitions. Complement of second has 4 states. [2022-02-21 04:35:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:44,771 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:44,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:44,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:44,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:44,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:44,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:44,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:44,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 04:35:44,772 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:44,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:44,772 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 04:35:44,773 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:35:44,773 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:44,773 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:44,773 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:44,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:44,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:44,773 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:35:44,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:44,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:44,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 04:35:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:35:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:35:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:35:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2022-02-21 04:35:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:44,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,777 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 04:35:44,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:35:44,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:44,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2022-02-21 04:35:44,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:44,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. cyclomatic complexity: 7 [2022-02-21 04:35:44,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:44,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2022-02-21 04:35:44,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:35:44,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:35:44,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:35:44,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:44,779 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:44,779 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:44,779 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:35:44,779 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:44,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:35:44,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:35:44,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:35:44,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:35:44 BoogieIcfgContainer [2022-02-21 04:35:44,799 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:35:44,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:35:44,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:35:44,800 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:35:44,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:39" (3/4) ... [2022-02-21 04:35:44,802 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:35:44,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:35:44,803 INFO L158 Benchmark]: Toolchain (without parser) took 5877.20ms. Allocated memory was 86.0MB in the beginning and 161.5MB in the end (delta: 75.5MB). Free memory was 51.7MB in the beginning and 80.2MB in the end (delta: -28.5MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2022-02-21 04:35:44,808 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:44,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.62ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 51.6MB in the beginning and 93.4MB in the end (delta: -41.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:35:44,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.96ms. Allocated memory is still 125.8MB. Free memory was 93.4MB in the beginning and 91.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:44,809 INFO L158 Benchmark]: Boogie Preprocessor took 24.23ms. Allocated memory is still 125.8MB. Free memory was 91.4MB in the beginning and 90.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:44,810 INFO L158 Benchmark]: RCFGBuilder took 316.89ms. Allocated memory is still 125.8MB. Free memory was 90.1MB in the beginning and 78.0MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:44,810 INFO L158 Benchmark]: BuchiAutomizer took 5116.87ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 78.0MB in the beginning and 80.2MB in the end (delta: -2.2MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-02-21 04:35:44,810 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 161.5MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:44,811 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.62ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 51.6MB in the beginning and 93.4MB in the end (delta: -41.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.96ms. Allocated memory is still 125.8MB. Free memory was 93.4MB in the beginning and 91.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.23ms. Allocated memory is still 125.8MB. Free memory was 91.4MB in the beginning and 90.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 316.89ms. Allocated memory is still 125.8MB. Free memory was 90.1MB in the beginning and 78.0MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5116.87ms. Allocated memory was 125.8MB in the beginning and 161.5MB in the end (delta: 35.7MB). Free memory was 78.0MB in the beginning and 80.2MB in the end (delta: -2.2MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 161.5MB. Free memory is still 80.2MB. 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[nondetString1] and consists of 5 locations. One deterministic module has affine ranking function -1 * p + unknown-#length-unknown[p] and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 27 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax113 hnf100 lsp87 ukn82 mio100 lsp45 div114 bol100 ite100 ukn100 eq165 hnf92 smp92 dnf143 smp83 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 8 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:35:44,838 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 [2022-02-21 04:35:45,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE